Abstract
In this paper it is shown, through computational results, that a schedule generation algorithm originally designed for the traditional job shop model can still provide good results, in terms of CPU time and solution accuracy, when applied to the flexible manufacturing system (FMS) model. For this, we use two algorithms, for the job shop and the FMS, that generate all active schedules. Both algorithms are improved, by adding to them a branch-and-bound approach, and their behaviour is compared.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nascimento, M. Giffler and Thompson's Algorithm for Job Shop Scheduling is Still Good for Flexible Manufacturing Systems. J Oper Res Soc 44, 521–524 (1993). https://doi.org/10.1057/jors.1993.88
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1993.88