摘要

Scheduling of Batch Processing Machines (BPMs) is an important part of scheduling in semiconductor manufacturing. In this paper, an Ant Colony Optimization Algorithm-Immune Clone Selection Algorithm (ACO-ICSA) is proposed to obtain a near-optimal solution for a single BPM with consideration on dynamic arrival jobs. Lots of experiments have been implemented to validate and verify the proposed solution. It is shown that the proposed solution is superior to some single intelligent algorithms, such as Genetic Algorithm, Ant Colony Optimization Algorithm, and Immune Clone Selection Algorithm with better on-time delivery rate.