Advertisement

Journal of Scheduling

, Volume 10, Issue 1, pp 41–65 | Cite as

Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

  • Karthik Sourirajan
  • Reha Uzsoy
Article

Abstract

Most shop-floor scheduling policies used in practice rely on dispatching, making use of only local information at individual workcenters. However, in semiconductor manufacturing environments, we have access to real-time shop-floor status information for the entire facility. In these complex facilities, there would appear to be significant potential for improved schedules by considering global shop information and using optimization-based heuristics. To this end, we propose a rolling horizon (RH) heuristic that decomposes the shop into smaller subproblems that can be solved sequentially over time using a workcenter-based decomposition heuristic. We develop test instances for evaluating our heuristic using a simulation model of an industrial facility. The results demonstrate that the proposed heuristic yields better schedules than the dispatching rules in the vast majority of test instances with reasonable computational effort.

Keywords

Job shop scheduling Maximum lateness Shifting bottleneck Computational evaluation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., E. Balas, and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science, 3, 391–401 (1988).Google Scholar
  2. Aytug, H., K. Kempf, and R. Uzsoy, Measures of subproblem criticality for decomposition algorithms in job shop scheduling, International Journal of Production Research, 41, 865–882 (2002).CrossRefGoogle Scholar
  3. Aytug, H., M. A. Lawley, K. N. McKay, S. Moha, and R. Uzsoy, Executing production schedules in the face of uncertainty: a review and some future directions, European Journal of Operational Research, 161, 86–110 (2005).CrossRefGoogle Scholar
  4. Bai, X., N. Srivatsan, and S. B. Gershwin, Hierarchical real-time scheduling of a semiconductor fabrication facility, in Proceedings Ninth IEEE International Electronics Manufacturing Technology Symposium, Washington DC, October 1990.Google Scholar
  5. Balas, E., J. K. Lenstra, and A. Vazacopoulos, The one machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science, 41, 94–109 (1995).Google Scholar
  6. Balas, E. and A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Management Science, 44, 262–275 (1998).CrossRefGoogle Scholar
  7. Bhaskaran, K. and E. Pinedo, Dispatching, in Handbook of Industrial Engineering, Wiley, New York (1991) Chapter 83.Google Scholar
  8. Carlier, J., The one machine sequencing problem, European Journal of Operational Research, 11, 42–47 (1982).CrossRefGoogle Scholar
  9. Demirkol, E. and R. Uzsoy, Decomposition methods for reentrant flow shops with sequence dependent setup times, Journal of Scheduling, 3, 155–177 (2000).CrossRefGoogle Scholar
  10. Garey, M. R. and D.S. Johnson, Computers and Intractability: A Guide to Theory of NP Completeness, W.H. Freeman, San Francisco (1979).Google Scholar
  11. Hall, N.G. and N.G. Posner, Generating experimental data for computational testing with machine scheduling applications, Operations Research, 49(6), 854–865 (2001).CrossRefGoogle Scholar
  12. Kempf, K. G., Intelligently scheduling semiconductor wafer fabrication, in M. Zweben and M. Fox (eds.), Knowledge-Based Scheduling, Morgan Kaufman San Fransisco (1994).Google Scholar
  13. Law, A.M. and W.D. Kelton, Simulation Modeling and Analysis, McGraw Hill, Boston (1991).Google Scholar
  14. Leachman, R. C., Modeling techniques for automated production planning in the semiconductor industry, in T. A. Ciriani and R. C. Leachman (eds.), Optimization in Industry: Mathematical Programming and Modelling Techniques in Practice, Wiley, New York (1993).Google Scholar
  15. Lu, S. C. H., D. Ramaswamy, and P. R. Kumar, Efficient scheduling policies to reduce mean and variance of cycle-time semiconductor plants, IEEE Transactions on Semiconductor Manufacturing, 7 (3), 374–388 (1994).Google Scholar
  16. Mason, S. J., J. W. Fowler, and W. M. Carlyle, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Journal of Scheduling, 5, 247–262 (2002).CrossRefGoogle Scholar
  17. Mosley, S. A., T. Teyner, and R. M. Uzsoy, Maintenance scheduling and staffing policies in a wafer fabrication facility, IEEE Transactions on Semiconductor Manufacturing, 11(2), 316–323 (1998).CrossRefGoogle Scholar
  18. Ovacik, I.M. and R. Uzsoy, Decomposition Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, Norwell, MA (1997).Google Scholar
  19. Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Upper Saddle River, NJC (1995).Google Scholar
  20. Pinedo, M. and M. Singer, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop, Naval Research Logistics, 46, 1–17 (1999).CrossRefGoogle Scholar
  21. Rardin, R. L. and R. Uzsoy, Experimental evaluation of heuristic optimization algorithms: A tutorial, Journal of Heuristics, 7(3), 261–304 (2001).CrossRefGoogle Scholar
  22. Roy, B. and B. Sussmann, Les problems d’ordonnancement avec des contraintes disjonctives, Note DS No. 9 bis, SEMA, Montrouge (1964).Google Scholar
  23. Song, W. T. and B. Schmeiser, Reporting the precision of simulation experiments, in New Directions in Simulation for Manufacturing and Communications, Operations Research Society of Japan (1994) pp. 402–407.Google Scholar
  24. Sun, X. and J. S. Noble, An approach to job shop scheduling with sequence-dependent setups, Journal of Manufacturing Systems, 18, 416–430 (1999).CrossRefGoogle Scholar
  25. Uzsoy, R., Scheduling batch processing machines with incompatible job families, International Journal of Production Research, 33, 2605–2708 (1995).Google Scholar
  26. Uzsoy, R., C.Y. Lee, and L.A. Martin-Vega, A review of production planning and scheduling models in the semiconductor industry. 2. shop-floor control, IEE Transactions, 26(5), 44–55 (1994).Google Scholar
  27. Uzsoy, R. and C.-S.Wang, performance of decomposition procedures for job shop scheduling problems with bottleneck machines, International Journal of Production Research, 38(6), 1271–1286 (2000).CrossRefGoogle Scholar
  28. Wang, C.-S., Decomposition heuristics for complex job shop scheduling, Ph.D. Thesis, School of Industrial Engineering, Purdue University, West Lafayette (2000).Google Scholar
  29. Yoo, W. S. and L. A. Martin-Vega, a decomposition methodology for scheduling semiconductor testing operation for number of tardy job measures, Research Report, Department of Computer Science, Utah State University (1996).Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Karthik Sourirajan
    • 1
  • Reha Uzsoy
    • 1
  1. 1.Laboratory for Extended Enterprises at Purdue, School of Industrial EngineeringPurdue UniversityWest LafayetteUSA

Personalised recommendations