Skip to main content
SpringerLink
Log in

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

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

Abstract

This paper proposes a modified shifting bottleneck heuristic (MSBH) for the reentrant job shop scheduling problem (RJSSP) with makespan minimization objective. Recently, the reentrant job shop has come into prominence as a new type of manufacturing shop. The principle characteristic of a reentrant job shop is that a job may visit certain machines more than once during the process flow, whereas in the classic job shop, each job visits a machine only once. The shifting bottleneck heuristic (SBH) is one of the most successful heuristic approaches for the classical job shop scheduling problem, which decomposes the problem into a number of single-machine subproblems. This paper adapts the SBH for the RJSSP and proposes a new sequencing heuristic for the single-machine maximum lateness subproblem considering the reentrant jobs in order to handle large-size RJSSPs. It also uses a subproblem criticality measure that further shortens the implementation time. The proposed MSBH is tested by using instances up to 20 machines and 100 jobs, and it is illustrated that good quality solutions can be obtained in reasonable computational times. A real-life application of the MSBH is also given as a case study to evaluate its performance.

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. Garey MR, Johnson DS (1979) Computer and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA

    Google Scholar 

  2. Uzsoy R, Lee CY, Martin-Vega LA (1992) A review of production planning and scheduling models in the semiconductor industry, part 1: system characteristics, performance evaluation and production planning. IIE Trans 24:47–61 doi:10.1080/07408179208964233

    Article  Google Scholar 

  3. Mason SJ, Fowler JW, Carlyle WM (2002) A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shop. J Sched 5(3):247–262 doi:10.1002/jos.102

    Article  MATH  MathSciNet  Google Scholar 

  4. Mönch L, Drießel R (2005) A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49:363–380 doi:10.1016/j.cie.2005.06.004

    Article  Google Scholar 

  5. Kubiak W, Lou SXC, Wang Y (1996) Mean flow time minimization in reentrant job shops with a hub. Oper Res 44:764–776 doi:10.1287/opre.44.5.764

    Article  MATH  Google Scholar 

  6. Che A, Chu C (2005) A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. Oper Res Lett 33:274–284 doi:10.1016/j.orl.2003.10.012

    Article  MATH  MathSciNet  Google Scholar 

  7. Che A, Chu C (2007) Cyclic hoist scheduling in large real-life electroplating lines. OR Spec 29(3):445–470 doi:10.1007/s00291-006-0040-9

    Article  MATH  MathSciNet  Google Scholar 

  8. Wagner HM (1959) An integer linear-programming model for machine scheduling. Nav Res Logist 6:131–140 doi:10.1002/nav.3800060205

    Article  Google Scholar 

  9. Bowman EH (1959) The scheduling-sequence problem. Oper Res 7:621–624 doi:10.1287/opre.7.5.621

    Article  Google Scholar 

  10. Manne AS (1960) On the job shop scheduling problem. Oper Res 8:219–223 doi:10.1287/opre.8.2.219

    Article  MathSciNet  Google Scholar 

  11. Fisher ML, Lageweg BJ, Lenstra JK, Rinnooy Kan AHG (1983) Surrogate duality relaxation for job shop scheduling. Discrete Appl Math 5:65–70 doi:10.1016/0166-218X(83)90016-1

    Article  MATH  Google Scholar 

  12. Blazewicz J, Dror M, Weglarz J (1991) Mathematical programming formulations for machine scheduling: a survey. Eur J Oper Res 51:283–300 doi:10.1016/0377-2217(91)90304-E

    Article  MATH  Google Scholar 

  13. Liao CJ, You CT (1992) An improved formulation for the job-shop scheduling problem. J Oper Res Soc 23(11):1047–1054

    Article  Google Scholar 

  14. Pan JCH (1997) A study of integer programming formulations for scheduling problems. J Oper Res Soc 28:33–41

    MATH  Google Scholar 

  15. Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Manage Sci 35:164–176 doi:10.1287/mnsc.35.2.164

    Article  MATH  MathSciNet  Google Scholar 

  16. Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job shop scheduling problem. Discrete Appl Math 49:102–127 doi:10.1016/0166-218X(94)90204-6

    Article  MathSciNet  Google Scholar 

  17. Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30:109–118

    Google Scholar 

  18. Aytug H, Kempf K, Uzsoy R (2002) Measures of subproblem criticality in decomposition algorithms for shop scheduling. Int J Prod Res 41(5):865–882 doi:10.1080/0020754021000037856

    Article  Google Scholar 

  19. Bhaskaran K, Pinedo M (1991) Dispatching. In: Salvendy G (ed) Handbook of industrial engineering. Wiley, New York

    Google Scholar 

  20. 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(6):1243–1263 doi:10.1080/00207549408956998

    Article  MATH  Google Scholar 

  21. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391–401 doi:10.1287/mnsc.34.3.391

    Article  MATH  MathSciNet  Google Scholar 

  22. Ovacik IM, Uzsoy R (1992) A shifting bottleneck algorithm for scheduling semiconductor testing operations. J Electron Manuf 2:119–134 doi:10.1142/S0960313192000157

    Article  Google Scholar 

  23. Carlier J (1982) The one-machine sequencing problem. Eur J Oper Res 11:42–47 doi:10.1016/S0377-2217(82)80007-6

    Article  MATH  MathSciNet  Google Scholar 

  24. Dauzere-Peres S, Lasserre JB (1993) A modified shifting bottleneck procedure for job shop scheduling. Int J Prod Res 31:923–932 doi:10.1080/00207549308956766

    Article  MATH  Google Scholar 

  25. Balas E, Lenstra JK, Vazacopoulos A (1995) The one machine scheduling with delayed precedence constraints. Manage Sci 41:94–109 doi:10.1287/mnsc.41.1.94

    Article  MATH  Google Scholar 

  26. Roy B, Sussman B (1964) Les problémes d’ordonnancements avec contraintes disjonctives. Proceedings of SEMA, Montrouge

  27. Applegate D, Cook W (1991) A computational study of job shop scheduling. ORSA J Comput 3:149–156

    MATH  Google Scholar 

  28. Demirkol E, Mehta S, Uzsoy R (1997) A computational study of shifting bottleneck procedures for shop scheduling. J Heuristics 3(2):111–137 doi:10.1023/A:1009627429878

    Article  MATH  Google Scholar 

  29. Holtsclaw HH, Uzsoy R (1996) Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: a computational study. J Oper Res Soc 47(5):666–677

    Article  MATH  Google Scholar 

  30. Pinedo M, Singer M (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav Res Logist 46:1–17 doi:10.1002/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#

    Article  MATH  MathSciNet  Google Scholar 

  31. Ovacık IM, Uzsoy R (1997) Decomposition methods in large scale job shops. Kluwer, Boston

    Google Scholar 

  32. Yoo WS, Martin Vega LA (1997) A decomposition methodology for scheduling semiconductor test operations for number of tardy job measures. J Electron Manuf 7:51–60 doi:10.1142/S0960313197000063

    Article  Google Scholar 

  33. Ivens P, Lambrecht M (1996) Extending the shifting bottleneck procedure to real-life applications. Eur J Oper Res 90(2):252–268 doi:10.1016/0377-2217(95)00353-3

    Article  MATH  Google Scholar 

  34. Schutten M (1998) Practical job shop scheduling. Ann Oper Res 83:161–177 doi:10.1023/A:1018955929512

    Article  MATH  MathSciNet  Google Scholar 

  35. Jeong H, Park J, Leachman RC (1999) A batch splitting method for a job shop scheduling problem in an MRP environment. Int J Prod Res 37(15):3583–3598 doi:10.1080/002075499190194

    Article  MATH  Google Scholar 

  36. Sun X, Noble JS (1999) An approach to job shop scheduling with sequence-dependent setups. J Manuf Syst 18:416–430 doi:10.1016/S0278-6125(00)87643-8

    Article  Google Scholar 

  37. Oey K, Mason SJ (2001) Scheduling batch processing machines in complex job shops. Proceedings of the 2001 Winter Simulation Conference, pp 1200–1207

  38. Mason SJ, Oey K (2003) Scheduling complex job shops using disjunctive graphs: a cycle elimination procedure. Int J Prod Res 41(5):981–994 doi:10.1080/00207540210163009

    Article  Google Scholar 

  39. Pfund M, Yu L, Fowler J, Carlyle W (2002) The effects of processing time variability and equipment downtimes on various scheduling approaches for a printed wiring board assembly operation. J Electron Manuf 11(1):19–31 doi:10.1142/S0960313102000242

    Article  Google Scholar 

  40. Mönch L, Rose O, Sturm R (2003) A simulation framework for performance assessment of shop-floor control systems. Simulation. Trans Soc Model Comput Simul Int 79(3):163–170 doi:10.1177/0037549703256039

    Article  Google Scholar 

  41. Yeung T, Mason SJ (2006) Using real analysis to value reoptimization options in the shifting bottleneck heuristic. Nav Res Logist 53:285–297 doi:10.1002/nav.20144

    Article  MATH  MathSciNet  Google Scholar 

  42. Mönch L, Schabacker R, Pabst D, Fowler JW (2007) Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. Eur J Oper Res 177:2100–2118 doi:10.1016/j.ejor.2005.12.020

    Article  MATH  Google Scholar 

  43. Wenqi H, Aihua Y (2004) An improved shifting bottleneck procedure for the job shop scheduling problem. Comput Oper Res 31:2093–2110 doi:10.1016/S0305-0548(03)00243-0

    Article  MATH  MathSciNet  Google Scholar 

  44. Singer M (2001) Decomposition methods for large job shops. Comput Oper Res 28:193–207 doi:10.1016/S0305-0548(99)00098-2

    Article  MATH  MathSciNet  Google Scholar 

  45. Pan JCH, Chen JS (2005) Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Comput Oper Res 32:1197–1212

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Dokuz Eylul University, Tinaztepe Yerleskesi, Buca, 35160, Izmir, Turkey

    Seyda Topaloglu & Gamze Kilincli

Authors
  1. Seyda Topaloglu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gamze Kilincli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyda Topaloglu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Topaloglu, S., Kilincli, G. A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. Int J Adv Manuf Technol 44, 781–794 (2009). https://doi.org/10.1007/s00170-008-1881-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1881-y

Keywords

Search

Navigation