The shifting bottleneck procedure for job-shops with parallel machines Online publication date: Tue, 21-Feb-2006
by Kai-Pei Chen, Marvin S. Lee, P. Simin Pulat, Scott A. Moses
International Journal of Industrial and Systems Engineering (IJISE), Vol. 1, No. 1/2, 2006
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.
Online publication date: Tue, 21-Feb-2006
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com