Skip to main content
SpringerLink
Log in

Practical job shop scheduling

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop problems with practical features, such as transportation times, simultaneous resource requirements, setup times, and many minor but important other characteristics. We report on the continuous research in the area of extending the Shifting Bottleneck procedure to deal with those practical features. We call job shops with such additional features practical job shops. We discuss experiences with the Shifting Bottleneck procedure in a number of practical cases.

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. J. Adams, E. Balas and D. Zawack, The Shifting Bottleneck procedure for job shop scheduling, Management Science 34(1988)391–401.

    Google Scholar 

  2. E. Balas, J.K. Lenstra and A. Vazacopoulos, The one-machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science 41(1995)94–109.

    Google Scholar 

  3. E. Balas and A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Management Science Research Report No. MSRR-609, Carnegie-Mellon University, Graduate School of Industrial Administration, Pittsburg, PA, 1994.

    Google Scholar 

  4. G.A. Belderok, Ontwerp van een produktiebesturings-en informatiesysteem voor de produktie van zware persdelen in de plaat komponenten fabriek van DAF Trucks Eindhoven (in Dutch), Master's Thesis, Faculty of Mechanical Engineering, Production and Operations Management Group, University of Twente, Enschede, The Netherlands, 1993.

    Google Scholar 

  5. J.D. Blackburn, Time-Based Competition, The Next Battle Ground in American Manufacturing, Richard D. Irwin, Homewood, IL, 1991.

    Google Scholar 

  6. P. Brucker, B. Jurisch and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics 49(1994)107–127.

    Article  Google Scholar 

  7. J. Carlier, The one-machine sequencing problem, European Journal of Operational Research 11 (1982)42–47.

    Article  Google Scholar 

  8. J. Carlier, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, European Journal of Operational Research 29(1987)298–306.

    Article  Google Scholar 

  9. J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Management Science 35 (1989)164–176.

    Article  Google Scholar 

  10. S. Dauzère-Pérès, A procedure for the one-machine sequencing problem with dependent jobs, European Journal of Operational Research 81(1995)579–589.

    Article  Google Scholar 

  11. S. Dauzère-Pérès and J.-B. Lasserre, A modified shifting bottleneck procedure for job-shop scheduling, International Journal of Production Research 31(1993)923–932.

    Google Scholar 

  12. H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: Industrial Scheduling, eds. J.F. Muth and G.L. Thompson, Prentice-Hall, Englewood Cliffs, 1963, pp. 225–241.

    Google Scholar 

  13. Ph. Ivens and M. Lambrecht, Extending the shifting bottleneck procedure to real-life scheduling applications, European Journal of Operational Research 90(1996)252–268.

    Article  Google Scholar 

  14. G.J. Meester, Multi-resource shop floor scheduling, Ph.D. Thesis, University of Twente, Enschede, The Netherlands, 1996.

    Google Scholar 

  15. G.J. Meester and W.H.M. Zijm, Multi-resource scheduling for an FMC in discrete parts manufacturing, in: Flexible Automation and Integrated Manufacturing, eds. M.M. Ahmad and W.G. Sullivan, CRC Press, Atlanta, GA, 1993, pp. 360–370.

    Google Scholar 

  16. I.M. Ovacik and R. Uzsoy, A Shifting Bottleneck algorithm for scheduling semiconductor testing operations, Journal of Electronic Manufacturing 2(1992)119–134.

    Article  Google Scholar 

  17. F.F.J. Reesink, Werkplaatsbesturing met behulp van de Shifting Bottleneck Methode (in Dutch), Master's Thesis, Faculty of Mechanical Engineering, Production and Operations Management Group, University of Twente, Enschede, The Netherlands, 1993.

    Google Scholar 

  18. J.M.J. Schutten, Assembly shop scheduling, Technical Report LPOM-95-15, Faculty of Mechanical Engineering, Production and Operations Management Group, University of Twente, Enschede, The Netherlands, 1995.

    Google Scholar 

  19. J.M.J. Schutten, Shop floor scheduling with setup times: Efficiency versus leadtime performance, Ph.D. Thesis, University of Twente, Enschede, The Netherlands, 1996.

    Google Scholar 

  20. J.M.J. Schutten, S.L. van de Velde and W.H.M. Zijm, Single-machine scheduling with release dates, due dates and family setup times, Management Science 42(1996)1165–1174.

    Google Scholar 

  21. R.J.M. Vaessens, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by local search, to appear in Mathematical Programming.

  22. S.J. Westra, Het één-machine scheduling probleem met gefixeerde jobs (in Dutch), Master's Thesis, Faculty of Mechanical Engineering, Production and Operations Management Group, University of Twente, Enschede, The Netherlands, 1994.

    Google Scholar 

  23. A.P. Woerlee, Decision support systems for production scheduling, Ph.D. Thesis, Erasmus University, Rotterdam, The Netherlands, 1991.

    Google Scholar 

Download references

Authors
  1. J.M.J. Schutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schutten, J. Practical job shop scheduling. Annals of Operations Research 83, 161–178 (1998). https://doi.org/10.1023/A:1018955929512

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018955929512

Keywords

Search

Navigation