Practical job shop scheduling

J.M.J. Schutten

Annals of Operations Research, 1998, vol. 83, issue 0, 178 pages

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. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018955929512 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:161-178:10.1023/a:1018955929512

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018955929512

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().