[1] Rock H. The three-machine no-wait flowshop problem is NP-complete[J]. Journal of the Association for Computing Machinery, 1984, 31(2): 336-345. [2] Bassem Jarboui, Saber Ibrahim, Patrick Siarry, Abdelwaheb Rebai. A combinatorial particle swarm optimisation for solving permutation flowshop problems[J]. Computers & Industrial Engineering, 2008, 54: 526-538. [3] Hall N G, Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process[J]. Operations research, 1996, 44(3): 510-525. [4] Goyal S K, Sriskandarajah C. No-wait shop scheduling: computational complexity and approximate algorithms[J]. Operations research, 1988, 25: 220-244. [5] Van Deman J M, Baker K R. Minimisation mean flow time in flowshop with no intermediate queues[J]. AIIE Trans, 1974, 6: 28-34. [6] Tang L X, Luh P B, Liu J Y. Steel-making process scheduling using Lagrangian relaxation[J]. International Journal of Production Research, 2002, 40(1): 55-70. [7] Xuan H, Tang L X. Scheduling a hybrid flowshop with batch production as the last stage[J]. Computer & Operations Research, 2007, 34(9): 2718-2733. [8] 庞新福,俞胜平,张志宇,郑秉霖,柴天佑.炼钢-连铸生产优化重调度方法[J].系统工程学报,2010,25(1):98-104. [9] 刘明周,单晖,蒋增强,葛茂根,扈静,张铭鑫.不确定条件下车间动态重调度优化方法[J].机械工程学报,2009,45(10):137-142. [10] 杨琴,周国华,林晶晶,赵茜.基于DBR理论的柔性流水车间动态调度[J].控制与决策,2011,26(7):1109-1112. [11] 王利,赵珺,王伟.基于部分生产重构的冷轧生产重调度方法[J].自动化学报,2011,37(1):99-106. [12] 胡祥培,张漪,丁秋雷,王旭坪.干扰管理模型及其算法的研究进展[J].系统工程理论与实践,2008,10:40-46. [13] Qi X T, Bard J F, Yu G.Disruption management for machine scheduling:the case of SPT schedules[J].International Journal of Production Economics,2006,103(1): 166-184. [14] 潘逢山,叶春明.微粒群优化算法在流水线干扰管理调度中的应用[J].工业工程与管理,2012,17(4):48-53. [15] 李铁克,肖拥军,王柏琳.基于局部性修复的HFS机器故障重调度[J].管理工程学报,2010,24(3):45-49. [16] Pinedo M. Scheduling theory, algorithm and systems[M]. Fourth edition. New York: Springer Science+Business Media, LLC, 2012. [17] 潘全科,赵保华,屈玉贵.无等待流水车间调度问题的优化[J].计算机学报,2008,31(7):1147-1154. [18] Yu G, Qi X T. Disruption management: framework, models and applications[M]. First edition. Singapore: World Scientific Publishing Co. Pte. Ltd., 2004. [19] 王凌,刘波.微粒群优化与调度算法[M].第1版.北京:清华大学出版社,2008. [20] Ong Y S, Lim M H, Zhu N. Classification of adaptive memetic algorithms: a comparative study[J]. IEEE Trans. On Systems, Man and Cybernetics-B: Cybernetics, 2006, 36: 141-152. [21] Reeves C R, Yamada T. Genetic algorithms, path relinking and the flowshop sequencing problem[J]. Evolutionary Computation, 1998, 6: 45-60. [22] Reeves C R. Landscapes, operations and heuristic search[J]. Annals of Operations Research, 1999, 86: 473-490. [23] 李丽,牛奔.粒子群优化算法[M].第1版.北京:冶金工业出版社,2009. [24] Van Veldhuizen D A. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations[D]. Ohio: Dept. of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, 1999. [25] Czyak P, Jaskiewica A. Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization[J]. Journal of Multi-Criteria Decision Analysis, 1998, 7: 34-47. [26] Tan K C, Goh C K, Yang Y J. Evolving better population distribution and exploration in evolutionary multi-objective optimization[J]. European Journal of Operational Research, 2006, 171(1): 463-495. |