Skip to main content
SpringerLink
Log in

Job shop scheduling techniques in semiconductor manufacturing

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper presents a brief review on job shop scheduling techniques in semiconductor manufacturing. The manufacturing environment in a semiconductor industry is considered a highly complex job shop, involving multiple types of work centers, large and changing varieties of products, sequence-dependent setup times, reentrant process flow, etc., in a dynamic scheduling environment. Due to the stubborn nature of the deterministic job shop scheduling problem itself, many of the solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem-specific strategies. In this paper, we seek to provide a brief overview of the problem, the techniques used and the researchers involved in solving this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Panwalker S, Iskander W (1997) A survey of scheduling rules. Oper Res 25(1):45–61

    Google Scholar 

  2. Johri PK (1989) Dispatching in an integrated circuit wafer fabrication line. In: MacNair EA, Musselman KJ, Heidelberger P (eds) Proceedings of the 1989 Winter Simulation Conference, pp 918–921

  3. Uzsoy R, Church LK, Ovacik IM (1992) Dispatching rules for semiconductor resting operations), a computational study. IEEE/CHMT International Electronics Manufacturing Technology Symposium, IEEE, pp 272–276

  4. Holthaus O, Rajendran C (1997) Efficient dispatching rules for scheduling in a job shop. Int J Prod Econ 48:87–105

    Article  Google Scholar 

  5. Dabbas RM, Chen H-N, Fowler JW, Shunk D (2001) A combined dispatching criteria approach to scheduling semiconductor manufacturing systems. Comput Ind Eng 39:307–324

    Article  Google Scholar 

  6. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York

  7. Morton TE, Pentico DW (1993) Heuristic scheduling systems. Wiley, New York

  8. Sellers DW (1996) A survey of approaches to the job shop scheduling problem. Proceedings of the Twenty-Eighth Southeastern IEEE Symposium on System Theory, pp 396–400

  9. Blazewicz J, Domschke W, Pesch E: The job shop scheduling problem: conventional and new solution techniques. Eur J Oper Res 93:1–33

  10. Sung CS, Choung YI (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur J Oper Res 120:559-574

    Article  MATH  Google Scholar 

  11. Luh PB, Hoitomt DJ (1993) Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Trans Semicond Manuf 38(7):1066-1079

    MathSciNet  Google Scholar 

  12. Chen T-R, Chen C-W, Kao J (1993) Due windows scheduling for ic sort and test facilities with precedence constrains via Lagrangian relaxation. IEEE/SEMI International Semiconductor Manufacturing Science Symposium, pp 110–114

  13. Chen T-R, Hsia TC (1994) Job shop scheduling with multiple resources and an application to a semiconductor testing facility. Proceedings of the 33rd IEEE Conference on Decision and Control 2:1564–1570

    Google Scholar 

  14. Chen T-R, Hsia TC (1997) Scheduling for IC sort and test facilities with precedence constrains via Lagrangian relaxation. J Manuf Syst 16(2):117–128

    Google Scholar 

  15. Kaskavelis CA, Caramanis MC (1994) Application of a Lagrangian relaxation based scheduling algorithm to a semiconductor testing facility. Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology, IEEE, pp 106–112

  16. Kaskavelis CA, Caramanis MC (1998) Efficient Lagrangian relaxation algorithms for industrial size job-shop scheduling problems. IIE Trans 30:1085–1097

    Article  Google Scholar 

  17. Sun X, James SN, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113–124

    Article  Google Scholar 

  18. Yang J, Chang T-S (1998) Multiobjective scheduling for ic sort and test with a simulation testbed. IEEE Trans Semicond Manuf 11(2):304–315

    Article  Google Scholar 

  19. De S, Lee A (1998) Towards a knowledge-based scheduling system for semiconductor testing. Int J Prod Res 36(4):1045–1073

    Article  MATH  Google Scholar 

  20. Ovacik IM, Uzsoy R (1997) Decomposition methods for complex factory scheduling problems. Kluwer, Boston

  21. Uzsoy R, Martin-Vega LA, Lee C-Y, Leonard PA (1991) Production scheduling algorithms for a semiconductor test facility. IEEE Trans Semicond Manuf 4(4):270–280

    Article  Google Scholar 

  22. Perry CN, Uzsoy R (1993) Reactive scheduling of a semiconductor testing facility. IEEE/CPMT International Electronics Manufacturing Technology Symposium, pp 191–194

  23. Ovacik IM (1994) A decomposition methodology for scheduling complex job shops. Dissertation, Purdue University

  24. Demirkol E, Uzsoy R, Ovacik IM (1995) Decomposition algorithms for scheduling semiconductor testing facilities. IEEE/CPMT International Electronics Manufacturing Technology Symposium, pp 199–204

  25. Demirkol E, Uzsoy R (1997) Performance of decomposition methods for complex workshops under multiple criteria. Comput Ind Eng 33(1-2):261–264

    Google Scholar 

  26. Baskett F, Chandy KM, Muntz RR, Pala-Cios FG (1975) Open, closed, and mixed networks of queues with different classes of customers. J Assoc Comput Mach 22(2):248–260

    MATH  MathSciNet  Google Scholar 

  27. Connors D, Feigin G, Yao D (1994) Scheduling semiconductor lines using a fluid network model. IIE Trans Robot Autom 10(2):88–98

    Article  Google Scholar 

  28. Kumar S, Kumar PR (2001) Queuing network models in the design and analysis of semiconductor wafer fabs. IIE Trans Robot Autom 17(5):548–561

    Article  Google Scholar 

  29. Hopp WJ, Spearman ML, Chayet S, Donohue KL, Gel ES (2002) Using an optimized queuing network model to support wafer fab design. IIE Trans 34:119–130

    Article  Google Scholar 

  30. Pinedo M (1995) Scheduling, theory, algorithms and systems Prentice-Hall, Englewood Cliffs, NJ

  31. Glover F (1989) Tabu search – part I. ORSA J Comput 1(3):190–206

    MATH  MathSciNet  Google Scholar 

  32. Glover F (1990) Tabu search – part II. ORSA J Comput 2(1):4–32

    MATH  Google Scholar 

  33. Geiger CD, Kempf KG, Uzsoy R (1997) A Tabu search approach to scheduling an automated wet etch station. J Manuf Syst 16(2):102–116

    Article  Google Scholar 

  34. Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    MathSciNet  Google Scholar 

  35. Kiran AS (1998) Simulation and scheduling. In: Banks J (ed) Handbook of simulation. Wiley, New York, pp 677–717

  36. Yim SJ, Lee DY (1999) Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing. J Intell Manuf 10(6):531–540

    Article  Google Scholar 

  37. Goldberg D (1988) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Menlo Park, CA

  38. Cavalieri S, Crisafulli F, Mirabella O (1999) A genetic algorithm for job-shop scheduling in a semiconductor manufacturing system. IEEE Trans Eng Manage 41(2):957–961

    Google Scholar 

  39. Lam FSC, Lin BC, Sriskandarajah C, Yan H (1999) Scheduling to minimize product design time using a genetic algorithm. Int J Prod Res 37(6):1369–1386

    Article  MATH  Google Scholar 

  40. Wang CS, Uzsoy R (2002) A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput Oper Res 29:1621–1640

    Article  MathSciNet  Google Scholar 

  41. Yen BP-C, Pinedo M (1994) On the design and development of scheduling systems. Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology, IEEE, pp 197–204

  42. Aytug H, Bhattacharyya S, Koehler GJ, Snowdon JL (1994) A review of machine learning in scheduling, IEEE Trans Eng Manage 41(2):165–171

    Google Scholar 

  43. Zurada JM (1992) Introduction to artificial neural systems West Publishing, St. Paul, MN

  44. Zhang HC, Huang SH (1995) Applications of neural networks in manufacturing: a state-of-the-art survey. Int J Prod Res 33(3):705–728

    MATH  Google Scholar 

  45. Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353

    Article  MATH  MathSciNet  Google Scholar 

  46. Kuroda M, Wang Z (1996) Fuzzy job shop scheduling. Int J Prod Econ 44:45–51

    Article  Google Scholar 

  47. Azzaro-Pantel C, Floquet P, Pibouleau L, Domenech S (1997) A fuzzy approach for performance modeling in a batch plant: application to semiconductor manufacturing. IEEE Trans Fuzzy Syst 5(3):338–357

    Article  Google Scholar 

  48. Zhou MC, Jeng MD (1998) Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: a Petri net approach. IEEE Trans Semicond Manuf 11(3):333–357

    Article  Google Scholar 

  49. Xiong HH, Zhou MC (1998) Scheduling of semiconductor test facility via petri nets and hybrid heuristic search. IEEE Trans Semicond Manuf 11(3):384–393

    Article  Google Scholar 

  50. Odrey NG, Green JD, Appello A (2001) A generalized Petri net modeling approach for the control of re-entrant flow semiconductor wafer fabrication. Robot Comput Integr Manuf 17:5–11

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Supply Chain Management (CSCM), School of Mechanical and Production Engineering (MPE), Nanyang Technological University (NTU), Nanyang Avenue, 639798, Singapore, Singapore

    Amit Kumar Gupta & Appa Iyer Sivakumar

Authors
  1. Amit Kumar Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Appa Iyer Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amit Kumar Gupta.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupta, A., Sivakumar, A. Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27, 1163–1169 (2006). https://doi.org/10.1007/s00170-004-2296-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-004-2296-z

Keywords

Search

Navigation