Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

Due to its typical features, such as large-scale, multiple re-entrant flows, and hybrid machine types, the semiconductor wafer fabrication system (SWFS) is extremely difficult to schedule. In order to cope with this difficulty, the decomposition-based classified ant colony optimization (D-CACO) method is proposed and analyzed in this paper. The D-CACO method comprises decomposition procedure and classified ant colony optimization algorithm. In the decomposition procedure, a large and complicate scheduling problem is decomposed into several subproblems and these subproblems are scheduled in sequence. The classified ACO algorithm then groups all of the operations of the subproblems and schedules them according to machine type. To test the effect of the method, a set of simulations are conducted on a virtual fab simulation platform. The test results show that the proposed D-CACO algorithm works efficiently in scheduling SWFS.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  M. Mathirajan,et al.  Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints , 2008 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[5]  Doo Yong Lee,et al.  Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing , 1998, J. Intell. Manuf..

[6]  N. Zerhouni,et al.  An integrated ACO approach for the joint production and preventive maintenance scheduling problem in the flowshop sequencing problem , 2008, 2008 IEEE International Symposium on Industrial Electronics.

[7]  Yi-Feng Hung,et al.  DISPATCHING RULES USING FLOW TIME PREDICTIONS FOR SEMICONDUCTOR WAFER FABRICATIONS , 2002 .

[8]  Ali Husseinzadeh Kashan,et al.  Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework , 2008, J. Oper. Res. Soc..

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

[10]  John W. Fowler,et al.  Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops , 2007, Eur. J. Oper. Res..

[11]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[12]  Christian Blum,et al.  ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification , 2002, Ant Algorithms.

[13]  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.

[14]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[15]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[16]  Liu Hui-ran.  An EOPN-Based Real-Time Scheduling Simulation Platform of Wafer Fabrication System , 2006 .

[17]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[18]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[20]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[21]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[22]  P.R. Kumar.  Scheduling semiconductor manufacturing plants , 1994, IEEE Control Systems.

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

[24]  Reha Uzsoy,et al.  A capacity allocation problem with integer side constraints , 1998, Eur. J. Oper. Res..

[25]  Yang Song,et al.  Bottleneck Station Scheduling in Semiconductor Assembly and Test Manufacturing Using Ant Colony Optimization , 2007, IEEE Transactions on Automation Science and Engineering.

[26]  Huiran Liu,et al.  Modelling of semiconductor wafer fabrication systems by extended object-oriented Petri nets , 2005 .

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

[28]  Lawrence M. Wein,et al.  Scheduling semiconductor wafer fabrication , 1988 .

[29]  Loon Ching Tang,et al.  Dispatching heuristic for wafer fabrication , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[30]  Chen-Fu Chien,et al.  A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups , 2007, OR Spectr..

[31]  Reha Uzsoy,et al.  Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication , 2007, J. Sched..

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

[33]  Christopher D. Geiger,et al.  A Tabu search approach to scheduling an automated wet etch station , 1997 .

[34]  Fuh-Der Chou,et al.  A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem , 2008, Expert Syst. Appl..

[35]  Reha Uzsoy,et al.  Dispatching Rules For Semiconductor Testing Operations: A Computational Study , 1992, Thirteenth IEEE/CHMT International Electronics Manufacturing Technology Symposium.

[36]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[37]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[38]  Li Li,et al.  ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints , 2009 .

[39]  Marcos Singer,et al.  Decomposition methods for large job shops , 2001, Comput. Oper. Res..