Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Discrete lot sizing and scheduling problem under batch processing constraints in the semiconductor manufacturing

  • 421 Accesses

  • 2 Citations

Abstract

Highly advanced technology products are manufactured on the series of equipment having various characteristics and requirements. The deposition process of organic light emitting diode, for example, is performed in chambers for a long manufacturing time, while various product devices belonging to the same family can be processed in sequence before the preventive maintenance schedule or the refill of chemical gas required. The deposition process plays as a bottleneck, and its productivity of the schedule is critical to the upstream low-temperature poly silicon process and the downstream encapsulation and module processes as well. The batch family scheduling problem is formulated using the mixed-integer programming (MIP) in consideration of the family setups, lot sizing, supplementary mask tools requirements, and material exhaustion requirements. It is shown that the planning and scheduling decisions can be made simultaneously in an integrated model, and that it can be implemented in the actual manufacturing line. Through the optimized model analysis, the capacity can be enhanced by 20∼30 % without losing the throughput and demand satisfaction as well.

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

References

  1. 1.

    Akcali E, Hiscock DG (2000) Alternative loading and dispatching policies for furnace operations in semiconductor manufacturing: A comparison by simulation. Proceedings of the 2000 Winter Simulation Conferences, pp. 1428–1435

  2. 2.

    Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29:990–1001

  3. 3.

    Hung YF (1998) Scheduling of mask shop E-beam writers. IEEE Trans Semicond Manuf 11(1):165–172

  4. 4.

    Sung CS, Kim YH (2002) Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Comput Oper Res 29:275–294

  5. 5.

    Huang SC, Lin JT (1998) An interactive scheduling for a wafer probe centre in semiconductor manufacturing. Int J Prod Res 36(7):1883–1900

  6. 6.

    Wein LM (1988) Scheduling semiconductor wafer fabrication. IEEE Trans Semicond Manuf 1(3):115–129

  7. 7.

    Glassey CR, Resende MGC (1988) Closed-loop job release control for VSLI circuit manufacturing. IEEE Trans Semicond Manuf 1(1):36–46

  8. 8.

    Glassey CR, Resende MGC (1988) A scheduling rule for job release in semiconductor fabrication. Oper Res Lett 7:213–217

  9. 9.

    Spearman ML, Woodruff DL, Hopp WJ (1990) CONWIP: a pull alternative to kanban. Int J Prod Res 28(5):879–889

  10. 10.

    Pierce NG, Yurtsever DT (2000) Value-based dispatching for semiconductor wafer fabrication. The Proceedings of International Conference on modeling and Analysis of Semiconductor Manufacturing, Arizona, pp.172-176

  11. 11.

    Kim S, Yea S, Kim DB (2000) Stepper scheduling in semiconductor wafer fabrication process. Proceedings of the International Conference on Modeling and Analysis of Semiconductor Manufacturing, pp.157-162

  12. 12.

    Lee YH, Park JK, Kim SY (2002) Experimental study on input and bottleneck scheduling for a semiconductor fabrication line. IIE Trans 34:179–190

  13. 13.

    Lee YH, Kim TH (2002) Manufacturing cycle time reduction using balance control in the semiconductor fabrication line. Prod Plan Control 13(6):529–540

  14. 14.

    Quadt D, Kuhn H (2003) Production planning in semiconductor assembly. In C. T. Papadopoulos (ed) Proceedings of the Fourth Aegean International Conference on Analysis of Manufacturing Systems. University of the Aegean, Samos Island, Greece, pp.181-189

  15. 15.

    Gupta D, Magnusson T (2005) The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput Oper Res 32:727–747

  16. 16.

    Bixby R, Burda R, Miller D (2006) Short-interval detailed production scheduling in 300 mm semiconductor manufacturing using mixed integer and constraint programming, 17th Annual SEMI/IEEE Advanced Semiconductor Manufacturing Conference Boston., pp.148-154

  17. 17.

    Quadt D, Kuhn H (2005) Conceptual framework for lot-sizing and scheduling of flexible lines. Int J Prod Res 43(11):2291–2308

  18. 18.

    Chien CF, Chen CH (2007) A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups. OR Spectr 29:391–419

  19. 19.

    Blomer F, Gunter HO (1998) Scheduling of a multi-product batch process in the chemical industry. Comput Ind 36:245–259

  20. 20.

    Wu JZ, Chien CF (2008) Modeling semiconductor testing job scheduling and dynamic testing machine configuration. Expert Syst Appl 35:485–496

  21. 21.

    Toledo CFM, Kimms A, Franca PM, Morabito R (2006) A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem. J Oper Res Soc, in press

  22. 22.

    Toledo CFM, Franca PM, Morabito R, Kimms A (2008) Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. Int J Prod Res(1–23)

  23. 23.

    Kim YD, Joo BJ, Choi SY (2010) Scheduling wafer lots on diffusion machines in a semiconductor wafer fabrication facility. IEEE Trans Semicon Manufac 23(2):246–254

  24. 24.

    Karmarkar US, Schrage L (1985) The deterministic dynamic product cycling problem. Oper Res 33(2):326–345

  25. 25.

    Lasdon LS (1970) Optimization theory for large systems. McMillan, New York

  26. 26.

    Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, New York

  27. 27.

    Seeanner F, Meyr H (2013) Multi-stage simultaneous lot-sizing and scheduling for flow line production. OR Spectrum 35(1):33–73

  28. 28.

    Kopanos GM, Puigjaner L, Maravelias CT (2011) Production planning and scheduling of parallel continuous processes with product families. Ind Eng Chem Res 50:1369–1378

  29. 29.

    Camargo VCB, Toledo FMB, Almada-Lobo B (2012) Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries. J Oper Res Soc 63:1613–1630

Download references

Author information

Correspondence to Young Hoon Lee.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lee, J., Kim, S.H. & Lee, Y.H. Discrete lot sizing and scheduling problem under batch processing constraints in the semiconductor manufacturing. Int J Adv Manuf Technol 69, 383–396 (2013). https://doi.org/10.1007/s00170-013-5028-4

Download citation

Keywords

  • Integer programming
  • Semiconductor device manufacture
  • Scheduling
  • Planning