The shifting bottleneck procedure for job-shops with parallel machines

Kai-Pei Chen, Marvin S. Lee, P. Simin Pulat and Scott A. Moses

International Journal of Industrial and Systems Engineering, 2006, vol. 1, issue 1/2, 244-262

Abstract: The shifting bottleneck (SB) heuristic has been successfully applied to the job-shop scheduling problem. In this paper, the shifting bottleneck heuristic has been extended to solve job-shop problems with parallel machine workcentres. The efficient shifting bottleneck heuristic was developed to reduce the number of subproblems and provide tradeoff results between the computation time and the solution quality. The effect of bottleneck machine selection and reoptimisation procedures on the computational time is discussed. Moreover, a procedure is developed to achieve the desired makespan with near optimal number of machines of each machine type. The tradeoff between the makespan and the minimal number of machines required to achieve the makespan is also illustrated on few job-shop problems.

Keywords: job shop scheduling; heuristics; shifting bottleneck procedure; parallel machine scheduling; machine selection; reoptimisation; dispatching rules; makespan. (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=9059 (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:ids:ijisen:v:1:y:2006:i:1/2:p:244-262

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().