Advertisement

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

  • Li Li
  • Fei Qiao
  • Qidi Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)

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.

Keywords

Batch Processor Variable Arrival Time Single Batch Processing Machine Parallel Batch Processing Machine Parallel Batch Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mathirajan, M., Sivakumar, A.I.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. International Journal of Advanced Manufacturing Technology 29, 990–1001 (2006)CrossRefGoogle Scholar
  2. 2.
    Chien, C.F., Chen, C.H.: A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups. OR Spetrum 29, 391–419 (2007)zbMATHCrossRefGoogle Scholar
  3. 3.
    Erramilli, V., Mason, S.J.: Multiple orders per job compatible batch scheduling. IEEE Transactions on Electronics Packaging Manufacturing 29, 285–296 (2006)CrossRefGoogle Scholar
  4. 4.
    Mönch, L., Zimmermann, J., Otto, P.: Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines. Engineering Applications of Artificial Intelligence 19, 235–245 (2006)CrossRefGoogle Scholar
  5. 5.
    Liu, L.L., Ng, C.T., Cheng, T.C.E.: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. Theoretical Computer Science 374, 159–169 (2007)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Dorigo, M., Maniezzo, V., Alberto, C.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics 26, 29–41 (1996)CrossRefGoogle Scholar
  7. 7.
    Raghavan, N.R.S., Venkataramana, M.: Scheduling parallel batch processors with incompatible job families using ant colony optimization. In: Proceeding. of the 2006 IEEE International Conference on Automation Science and Engineering, Shanghai, China, pp. 507–512 (2006)Google Scholar
  8. 8.
    Balasubramanian, H., Mönch, L., Fowler, J.W., Pfund, M.E.: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. International Journal of Production Research 42, 1621–1638 (2004)zbMATHCrossRefGoogle Scholar
  9. 9.
    Mönch, L., Balasubramanian, H., Fowler, J.W., Pfund, M.E.: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers and Operations Research 32, 2731–2750 (2005)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Li Li
    • 1
  • Fei Qiao
    • 1
  • Qidi Wu
    • 1
  1. 1.School of Electronics & Information EngineeringTongji UniversityShanghaiChina

Personalised recommendations