ACO-based scheduling of parallel batch processing machines to minimize the total weighted tardiness

Authors:
L. Li;F. Qiao;Q. D. Wu
Affiliations:
School of Electronics and Information Engineering, Tongji University, Shanghai, China;School of Electronics and Information Engineering, Tongji University, Shanghai, China;School of Electronics and Information Engineering, Tongji University, Shanghai, China
Venue:
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Year:
2009

Citing 2
Cited 1

Ant Colony Optimization

Ant Colony Optimization
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research

Throughput optimization for pipeline workflow scheduling with setup times

Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops

Quantified Score

Hi-index	0.00

Visualization

Abstract

This research was motivated by the scheduling problem of parallel batch processing machines located in the diffusion and oxidation areas in a semiconductor wafer fabrication facility (wafer fab). The objective was to minimize the total weighted tardiness (TWT) on parallel batch processing machines which have incompatible job families, dynamic job arrivals, and constraints on the sequence-dependent setup time and the qualification-run requirements of advanced process control. Since the problem is NP-hard, an ant colony optimization (ACO) algorithm was used to achieve a satisfactory solution in a reasonable computation time. Extensive simulation experiments had been studied to demonstrate the effectiveness of the proposed method. The simulation results showed that the proposed ACO algorithm is superior to a modified Apparent Tardiness Cost-Batched Apparent Tardiness Cost rule adapted to dynamic job arrivals for minimizing the TWT. More machines or the bigger capacity, better improvement of the TWT is achieved. In addition, more machines, jobs or recipes require longer computation time, while bigger capacity requires less computation time.