[1] 王海军,王婧,马士华,杜丽敬.模糊供求条件下应急物资动态调度决策研究[J].中国管理科学,2014,22(1):55-64. [2] Yan P Y, Che A, Cai X Q, Tang X W. Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance[J]. Computers & Operations Research, 2014, 50 (10): 128-140. [3] 韩文民,高龙龙,翁红兵,黄劲松.基于阻塞流理论的船舶建造中管件加工虚拟单元调度问题研究[J].中国造船,2016,57(3):164-175. [4] Zhao Q, Yuan J. Pareto optimization of rescheduling with release dates to minimize make-span and total sequence disruption[J]. Journal of Scheduling, 2013, 16(3): 253-260. [5] 刘乐,周泓.急件到达干扰下开放式车间重调度方法[J].计算机集成制造系统,2014,20(7):1631-1642. [6] 薄洪光,潘裕韬,马晓燕.双机成比例无等待流水线重调度干扰管理研究[J].运筹与管理,2013,22(4):111-119. [7] Moratori P, Petrovic S, Vázquez-Rodríguez J A. Integrating rush orders into existent schedules for a complex job shop problem[J]. Applied Intelligence, 2010, 32(2): 205-215. [8] Moratori P, Petrovic S. Match-up approaches to a dynamic rescheduling problem[J]. International Journal of Production Research, 2012, 50(1): 261-276. [9] Chiu Y F, Shih C J. Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop[J]. International Journal of Production Research, 2012, 50(20): 5783-5794. [10] 刘乐,周泓.新工件到达干扰下单机最大延迟时间重调度[J].系统工程学报,2014,29(4):494-506. [11] Lu M S, Romanowski R. Multicontextual dispatching rules for job shops with dynamic job arrival[J]. The International Journal of Advanced Manufacturing Technology, 2013, 67(1): 19-33. [12] 庞新富,俞胜平,罗小川,潘全科,柴天佑.混合Job shop炼钢-连铸重调度方法及其应用[J].系统工程理论与实践,2012,32(4):826-838. [13] Al-Hinai N, Elmekkawy T Y. Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm[J]. International Journal of Production Economics, 2011, 132(2): 279-291. [14] Zhao C L, Tang H Y. Rescheduling problems with deteriorating jobs under disruptions[J]. Applied Mathematical Modelling, 2010, 34(1): 238-243. [15] 刘锋,王建军,饶卫振,杨德礼.安装时间与次序相关的生产调度干扰管理研究[J].中国管理科学,2014,22(1):45-54. [16] 薄洪光,张鑫,潘裕韬.混合无等待流水线干扰管理调度方法研究[J].运筹与管理,2016,25(3):246-254. [17] Blum C, Sampels M. An ant colony optimization algorithm for shop scheduling problems[J]. Journal of Mathematical Modelling & Algorithms, 2004, 3(3): 285-308. [18] Mak K L, Wang X X. Production scheduling and cell formation for virtual cellular manufacturing systems[J]. International Journal of Advanced Manufacturing Technology, 2002, 20(2): 144-152. [19] Qin W, Zhang J, Song D. An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time[J]. Journal of Intelligent Manufacturing, 2015. 1-14. [20] Gao K Z, Suganthan P N, Pan Q K, Tasgetiren M F, Sadollah A. Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion[J]. Knowledge-Based Systems, 2016, 109: 1-16. [21] Xiong Z, Li S, Chen J. Hardware/software partitioning based on dynamic combination of genetic algorithm and ant algorithm[J]. Journal of Software, 2005, 16(16). [22] Goyal K K, Jain P K, Jain M. A comprehensive approach to operation sequence similarity based part family formation in the reconfigurable manufacturing system[J]. International Journal of Production Research, 2013, 51(6): 1-15. [23] Kesen S E, Das S K, Güngör Z. A genetic algorithm based heuristic for scheduling of virtual manufacturing cells(VMCs)[J]. Computers & Operations Research, 2010, 37(6): 1148-1156. [24] Gao Y, Zhao P, Turng L, Zhou H. Intelligent optimization algorithms[M]. Computer Modeling for Injection Molding, 2013.283-292. [25] Wang X Q, Tang J F, Yung K L. A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches[J]. International Journal of Production Research, 2010, 48(12): 3513-3534. [26] 董蓉,何卫平.求解FJSP的混合遗传—蚁群算法[J].计算机集成制造系统,2012,18(11):2492-2501. [27] Zhang Q, Manier H, Manier M A. A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints[J]. International Journal of Production Research, 2014, 52(4): 985-1002. [28] 贾国柱,栾世超,陈亮,等.基于流程模块化的虚拟制造单元构建方法[J].系统工程理论与实践,2012,32(10):2111-2118. |