[1] Uzsoy R. Scheduling a Single Batch Processing Machine with Nonidentical Job Sizes[J]. International Journal of Production Research, 1994, 32(7): 1615-1635. [2] 程八一, 陈华平, 王栓狮, 等. 基于微粒群算法的单机不同尺寸工件批调度问题求解[J]. 中国管理科学, 2008, 16(3): 84-88. [3] 许 瑞, 陈华平, 邵 浩, 等. 极小化总完工时间批调度问题的两种蚁群算法[J]. 计算机集成制造系统, 2010, 16(6): 1255- 1264. [4] Damodaran P, Manjeshwar P K, Srihari K. Minimizing Makespan on a Batch-processing Machine with Non-identical Job Sizes Using Genetic Algorithms[J]. International Journal of Production Economics, 2006, 103(2): 882-891. [5] Chang Pingyu, Damodaran P, Melouk S. Minimizing Makespan on Parallel Batch Processing Machines[J]. International Journal of Production Research, 2004, 42(19): 4211-4220. [6] 舒 锋, 陈华平, 杜 冰, 等. 差异工件平行机批调度问题的SAGA[J]. 计算机应用研究, 2010, 27(12): 4526-4529. [7] Damodaran P, Srihari K. Mixed Integer Formulation to Minimize Makespan in a Flow Shop with Batch Processing Machines[J]. Mathematical and Computer Modelling, 2004, 40(13): 1465-1472. [8] Liao Chongjing, Liao Liman. Improved MILP Models for Two-machine Flowshop with Batch Processing Machines[J]. Mathematical and Computer Modelling, 2008, 48(7/8): 1254-1264. [9] Manjeshwar P K, Damodaran P, Srihari K. Minimizing Makespan in a Flow Shop with Two Batch-processing Machines Using Simulated Annealing[J]. Robotics and Computer-integrated Manufacturing, 2009, 25(3): 667-679.
[10] Mirsanei H S, Karimi B, Jolai F. Flow Shop Scheduling with Two Batch Processing Machines and Nonidentical Job Sizes[J]. International Journal of Advanced Manufacturing Technology, 2009, 45(5/6): 553-572. [11] Johnson S M. Optimal Two and Three Stage Production Schedules with Set-up Time Included[J]. Naval Research Logistic Quarterly, 1954, 1(1): 61-68. [12] Chen Huaping, Du Bing, Huang Guoquan. Scheduling a Batch Processing Machine with Non-identical Job Sizes: A Clustering Perspective[J]. International Journal of Production Research, 2011, 49(19): 5755-5778.
|