ACO-based scheduling for a single Batch Processing Machine in semiconductor manufacturing | IEEE Conference Publication | IEEE Xplore

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


Abstract:

This research is motivated by the scheduling problem in the diffusion and oxidation operations of semiconductor wafer fabrication facilities (fabs), where one machine is ...Show More

Abstract:

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.
Date of Conference: 23-26 August 2008
Date Added to IEEE Xplore: 19 September 2008
ISBN Information:

ISSN Information:

Conference Location: Arlington, VA, USA

References

References is not available for this document.