کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134553 | 956072 | 2011 | 12 صفحه PDF | دانلود رایگان |
In this paper, several methods for job shop scheduling are combined, adjusted and successfully applied to a real-world scheduling problem at a Belgian manufacturer producing industrial wheels and castors in rubber. The procedure is an extension of a hybrid shifting bottleneck procedure with a tabu search algorithm while incorporating various company specific constraints. The various extensions to cope with the company specific constraints have a strong similarity with the complex job shop problem formulation of Mason, Fowler, and Carlyle (2002). The new procedure is used as a simulation engine to test the relevance of various scenarios in order to improve the current planning approach of the company. A detailed computational experiment highlights the main contribution of the novel procedure for the company.
► We develop several methods for job shop scheduling problem.
► We solve a real-world scheduling problem at a Belgian manufacturer producing industrial wheels and castors in rubber.
► We test various alternatives to suggest improvements to the company.
Journal: Computers & Industrial Engineering - Volume 61, Issue 3, October 2011, Pages 697–708