[1]Potts C N. Scheduling TwoJob Classes on a Single Machine[J]. Computers &. Operations Research, 1991, 18( 5) : 411-415.
[2]Webster S, Baker K R. Scheduling Groups ofJobs on a Single Machine[J]. Operations Research, 1995, 43(4) :692-703.
[3]陈亚绒[1,2],管在林[1],彭运芳[1],邵新宇[1].面向大规模定制的瓶颈成组调度启发式方法研究[J].中国机械工程,2010(8):957-962.
[4]Potts C N, Kovalyov M Y. Scheduling with Batc?hing i A Review[J]. EuropeanJournal of Operational Research, 2000,120 (2) : 228-249.
[5]Hitomi Kv Ham 1. Operations Scheduling for Group Technology Applications[J]. Annals of the CIRP, 1976,25(1):419-422.
[6]GhoshJ B. Batch Scheduling to Minimize Total Completion Time[J]. Operations Research Letters, 1994,6(5),271-275.
[7]Panwalkar S Sv Smith M L,Koulamas C P. A Heu?ristic for the Single Machine Tardiness Problem[J]. EuropeanJournal of Operational Research, 1993,70 (3) ,304-310.
[8]Liao L M, Liao CJ. A Tabu Search Approach for Single Machine Scheduling with Major and Minor Setups[J]. InternationalJournal of Industrial Engi?nee ring , Theory Applications and Practice, 2002, 9 (2) ,174-183.
[9]王秀利[1],吴惕华[2],刘磊[3].一种求解单机成组作业优化调度的启发算法[J].计算机仿真,2003,20(2):48-50.
[10]Mason AJ. Genetic Algorithms and Scheduling Problems[D]. Cambridge, University of Cam?bridge, UK, 1992.
[11]聂黎[1],高亮[1],胡译丹[1].基于前序基因表达式编程的单机成组调度算法[J].计算机集成制造系统,2007,13(11):2261-2268.
[12]Crauwels H AJ , Potts C N, van Wassenhove L N. Local Search Heuristics for Single Machine Sched?uling with Batch Set- up Times to Minimize To?tal Weighted Completion Time[J]. Annals of Op?erations Research,1997, 70,261-279.
[13]BeckJ C,Fox M S. Dynamic Problem Structure A?nalysis as a Basis for Constraint- directed Sched?uling Heuristics[J]. Artificial Intelligence, 2000 (117) ,31-81.
[14]WatsonJ P, BeckJ C. A Hybrid Constraint Pro?gramming/Local Search Approach to 'theJob?Shop Scheduling Problem[CJ/ /Conference on In?tegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Paris, 2008,5015: 263-277.
[15]Malapert A,Gueret C, Rousseau LM. A Constraint Programming Approach for a Batch Processing Problem with Non - identicalJob Sizes[J]. Euro?peanJournal of Operational Research, 2012,221 (3) ,533-545. |