ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This research is motivated by the scheduling problem in the diffusion and oxidation areas of semiconductor wafer fabrication facilities (fabs), where the machines are modeled as Parallel Batch Processing Machines (PBPM). The objective is to minimize the Total Weighted Tardiness (TWT) on PBPM with incompatible lot families and dynamic lot arrivals, with consideration on the sequence-dependent setup times. Since the problem is NP-hard, Ant Colony Optimization (ACO) is used to achieve a satisfactory solution in a reasonable computation time. A number of experiments have been implemented to demonstrate 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 has been improved by 38.49% on average. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, L., Qiao, F., & Wu, Q. (2008). ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5217 LNCS, pp. 219–226). https://doi.org/10.1007/978-3-540-87527-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free