Integrated heuristics for scheduling multiple order jobs in a complex job shop

Scheduling in semiconductor manufacturing involves numerous types of complexities, including assignment of orders to front-opening unified pods (FOUPs), assignment of FOUPs to batches, and batch processing on single or parallel machines in multiple tool-groups with re-entrant flows. Based on these features, wafer fabrication in semiconductor manufacturing is referred to as a complex job shop in the literature. Assignment of multiple customer orders to jobs/FOUPs and scheduling them in a complex job shop environment is labelled as MOJ-CJSSP (multiple orders per job complex job shop scheduling problem). In this paper, we present constraint programming (CP), ant colony optimisation (ACO), and integrated CP-ACO approaches to minimise the sum of weighted completion times of the orders in MOJ-CJSSP.

[1]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[2]  A.A. Rodriguez,et al.  Hierarchical modeling and control of re-entrant semiconductor manufacturing facilities , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[3]  Scott J. Mason,et al.  Scheduling complex job shops using disjunctive graphs: A cycle elimination procedure , 2003 .

[4]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[5]  Jagadish Jampani,et al.  Column generation heuristics for multiple machine, multiple orders per job scheduling problems , 2008, Ann. Oper. Res..

[6]  Lars Mönch,et al.  A distributed shifting bottleneck heuristic for complex job shops , 2005, Comput. Ind. Eng..

[7]  Bernd Meyer,et al.  Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO , 2008, Hybrid Metaheuristics.

[8]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[9]  J. Christopher Beck,et al.  A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem , 2008, CPAIOR.

[10]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  S.J. Mason,et al.  Metaheuristic scheduling of 300-mm lots containing multiple orders , 2005, IEEE Transactions on Semiconductor Manufacturing.

[12]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[13]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[14]  Cheng-Shuo Wang.  Decomposition heuristics for complex job shop scheduling , 2000 .

[15]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[16]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[17]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[18]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[19]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[20]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[21]  Jagadish Jampani,et al.  A column generation heuristic for complex job shop multiple orders per job scheduling , 2010, Comput. Ind. Eng..

[22]  Jagadish Jampani.  Heuristics for multiple orders per job scheduling problems , 2007 .

[23]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .