Skip to main content
SpringerLink
Log in

A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper addresses a heuristic algorithm that minimizes total weighted tardiness for reentrant flow shop problems with sequence-dependent set up time. The proposed algorithm consists of three phases: prior plan phase, initial solution generation phase and solution improvement phase. In the first phase, a reentrant order with cyclic process is divided into a number of jobs. An initial solution is obtained by a RATCS (revised apparent tardiness cost with setups) rule in the second phase, and the last phase employs a RHTS (rolling horizon tabu search) to improve the solution. The experimental results show that the proposed algorithms give very efficient schedules in terms of total weighted tardiness and computational effort.

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. Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Upper Saddle River, NJ

    MATH  Google Scholar 

  2. Ovacik IM, Uzsoy R (1994) Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence dependent setup times. Int J Prod Res 32:1243–1263

    Article  MATH  Google Scholar 

  3. Lawler EL (1997) A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Annals Discr Math 1:331–342

    Article  Google Scholar 

  4. Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37:798–804

    MATH  MathSciNet  Google Scholar 

  5. Tang CS (1990) Scheduling batches on parallel machines with major and minor set-ups. Europ J Oper Res 46:28–37

    Article  MATH  Google Scholar 

  6. Bitran GR, Gilbert SM (1990) Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost. J Manuf Oper Manage 3:190–206

    MathSciNet  Google Scholar 

  7. Vepsalainen A, Morton TE (1987) Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Manage Sci 33:1036–1047

    Google Scholar 

  8. Raman N, Rachamadugu RV, Talbot FB (1989) Real-time scheduling on an automated machine center. Europ J Oper Res 40:222–242

    Article  MATH  Google Scholar 

  9. Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Europ J Oper Res 100:464–474

    Article  MATH  Google Scholar 

  10. Kim SY, Lee YH, Agnihotri D (1995) A hybrid approach to sequencing jobs using heuristic rules and neural networks. Prod Plan Control 6:445–454

    Article  Google Scholar 

  11. Eom DH, Shin HJ, Kwun IH, Shim JK, Kim SS (2002) Scheduling jobs on parallel machines with sequence-dependent family set-up times. Int J Adv Manuf Technol 19:26–932

    Article  Google Scholar 

  12. Shin HJ, Kim CO, Kim SS (2002) A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. Inter J Adv Manuf Technol 19:859–866

    Article  Google Scholar 

  13. Islam A, Eksioglu M (1997) A tabu search approach for the single machine mean tardiness problem. J Oper Res Soc 48:751–755

    Article  MATH  Google Scholar 

  14. James RJW (1997) Using tabu search to solve the common due date early/tardy machine scheduling problem. Comput Oper Res 24(3):199–208

    Article  MATH  MathSciNet  Google Scholar 

  15. Kim CO, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted tabu search approach. Int J Adv Manuf Technol 22:278–287

    Article  Google Scholar 

  16. Bemporad A, Morari M (1999) Control of systems integrating logic, dynamics, and constraints. Automatica 35:407–427

    Article  MATH  MathSciNet  Google Scholar 

  17. Hsu Ch, Shamma JS (1997) Receding horizon control for manufacturing systems. Proc. ACC, Albuquerque, NM, pp 1914–1918

  18. Graves SC, Meal HC, Stefek D, Zeghmi AH (1983) Scheduling of re-entrant flow shops. J Oper Manage 3:197–207

    Article  Google Scholar 

  19. Kubiak W, Lou SXC, Wang YM (1996) Mean flow time minimizations in re-entrant job shops with hub. Oper Res 44:764–776

    Article  MATH  Google Scholar 

  20. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Sched 3:155–177

    Article  MATH  MathSciNet  Google Scholar 

  21. Zaslavsky BG, Rodriguez AA, Collins DW (1997) Time-optimal control for re-entrant semiconductor fabrication lines. Proceedings of the IEEE Conference on Decision and Control Part 1 of 5, December 1997, San Diego, CA, pp 102–107

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Systems and Information Engineering, Korea University, Seoul, 136-701, Republic of Korea

    Yong-Ha Kang & Sung-Shick Kim

  2. Department of Industrial Information and Systems Engineering, Sangmyung University, Cheonan-si, Chungcheongnam-do, 330-720, Republic of Korea

    Hyun Joon Shin

Authors
  1. Yong-Ha Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sung-Shick Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyun Joon Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyun Joon Shin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kang, YH., Kim, SS. & Shin, H.J. A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture. Int J Adv Manuf Technol 35, 566–574 (2007). https://doi.org/10.1007/s00170-006-0736-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0736-7

Keywords

Search

Navigation