ACO-based scheduling for a single Batch Processing Machine in semiconductor manufacturing

This research is motivated by the scheduling problem in the diffusion and oxidation operations of semiconductor wafer fabrication facilities (fabs), where one machine is modeled as a single batch processing machine. The objective is to minimize the total weighted tardiness (TWT) on a single batch processing machine (BPM) with incompatible lot families and dynamic lot arrivals, with consideration on the sequence-dependent setup time. Since the problem is NP-hard, ant colony optimization (ACO) is used to achieve a satisfactory solution in a reasonable computation time. Extensive experiments have been implemented to validate and verify the proposed method. It is shown by the simulation results that the proposed method is superior to the common apparent tardiness cost- batched apparent tardiness cost (ATC-BATC) rule with smaller TWT and makespan, especially TWT that is improved by 40.07% on average.

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

[2]  John W. Fowler,et al.  THE INCLUSION OF FUTURE ARRIVALS AND DOWNSTREAM SETUPS INTO WAFER FABRICATION BATCH PROCESSING DECISIONS , 2002 .

[3]  D. J. van der Zee,et al.  Dynamic scheduling of batch-processing machines with non-identical product sizes , 2007 .

[4]  V. Erramilli,et al.  Multiple Orders Per Job Compatible Batch Scheduling , 2006, IEEE Transactions on Electronics Packaging Manufacturing.

[5]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[6]  Appa Iyer Sivakumar,et al.  Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching , 2007 .

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

[8]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[9]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[10]  T. C. Edwin Cheng,et al.  Scheduling jobs with agreeable processing times and due dates on a single batch processing machine , 2007, Theor. Comput. Sci..

[11]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

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

[13]  P. Chang,et al.  A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem , 2006 .

[14]  Lars Mönch,et al.  Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines , 2006, Eng. Appl. Artif. Intell..

[15]  N. R. Srinivasa Raghavan,et al.  Scheduling Parallel Batch Processors with Incompatible Job Families Using Ant Colony Optimization , 2006, 2006 IEEE International Conference on Automation Science and Engineering.

[16]  Lars Mönch,et al.  Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint , 2006, OR Spectr..