ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness

Conference Paper · September 2008with5 Reads
DOI: 10.1007/978-3-540-87527-7_20 · Source: DBLP
Conference: Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings


    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.