Skip to main content
Log in

A note on the shifting bottleneck procedure for job shop scheduling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We prove a result for the head–body–tail problem that has several consequences regarding the shifting bottleneck procedure described by Adams (Manag Sci 34:391–401, 1988). In particular, we show that for a machine with exactly two operations, the one-machine subproblem without precedence constraints cannot lead to a cycle. This provides insight on an erroneous example given in the renowned scheduling textbook of Pinedo (Scheduling: theory, algorithms, and systems, Springer, New York, 2016).

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

Download references

Acknowledgements

This research was partially conducted while I was working on a TÜBİTAK (The Scientific and Technological Research Council of Turkey) project in Agena BST, Teknopark Istanbul. I am grateful to M. Fatih Hocaoǧlu and İbrahim Genç for giving me this opportunity.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Murat Güngör.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Güngör, M. A note on the shifting bottleneck procedure for job shop scheduling. J Sched 26, 399–402 (2023). https://doi.org/10.1007/s10951-022-00773-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-022-00773-3

Keywords

Navigation