Article ID: | iaor1996137 |
Country: | United Kingdom |
Volume: | 2 |
Issue: | 1 |
Start Page Number: | 45 |
End Page Number: | 60 |
Publication Date: | Jan 1995 |
Journal: | International Transactions in Operational Research |
Authors: | Agnetis Alessandro, Oriolo Gianpaolo |
Keywords: | heuristics |
This paper addresses a problem related to the classical job shop scheduling problem with two jobs. The problem consists in concurrently determining the best subset of machines to be duplicated and the optimal scheduling of the operations in order to minimize completion time. Such a problem arises in the tool management for a class of flexible manufacturing cells. The job shop with two jobs is first reviewed, the application of the classical search algorithm