[1]Tang Lixin, Liu Jiyin, Rong Aiying, et al. A review of planning and scheduling systems and methods for integrated steel production [J]. European Journal of Operational Research, 2001, 133(1): 120.[2]Allahverdi A, Ng C T, Cheng T C E, et al. A survey of scheduling problems with setup times or costs [J]. European Journal of Operational Research, 2008, 187(3): 9851032.[3]Liu Shi Qiang, Kozan E. Scheduling a flow shop with combined buffer conditions [J]. International Journal of Production Economics, 2009, 117(2): 371380.[4]Sara Hatami S E, Reza TavakkoliMoghaddam, Yasaman Maboudian. Two metaheuristics for threestage assembly flowshop scheduling with sequencedependent setup times [J]. The International Journal of Advanced Manufacturing Technology, 2010, 50(912): 11531164.[5]Michael R, Garey D S J. Computers and intractability: A guide to the theory of Npcompleteness. [M]. New York: W. H. Freeman & Co Ltd, 1979.[6]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 1996, 26(1): 2941.[7]郭乘涛, 江志斌. 应用混合蚁群算法求解并行批处理机组批与调度问题 [J]. 上海交通大学学报, 2010, 44(8): 10681073.GUO Chengtao, JIANG Zhibin. A hybrid ant colony optimization method for scheduling jobs on parallel batch machines[J]. Journal of Shanghai Jiaotong University, 2010, 44(8): 10681073.[8]王笑蓉. 蚁群优化的理论模型及在生产调度中的应用研究 [D]. 杭州:浙江大学, 2003.[9]詹士昌, 徐婕, 吴俊. 蚁群算法中有关算法参数的最优选择 [J]. 科技通报, 2003, 19(5): 381386.ZHAN Shichang, XU Jie, WU Jun. The optimal selection on the parameters of the ant colony algorithm[J]. Bulletin of Science and Technology, 2003, 19(5): 381386.[10]Pinedo M. Scheduling: Theory, algorithms, and systems [M]. 3nd ed. New York: PrenticeHall, 2008.[11]Reeves C R. A genetic algorithm for flowshop sequencing [J]. Computers & Operations Research, 1995, 22(1): 513. |