The two-machine open shop problem: To fit or not to fit, that is the question

The two-machine open shop problem: To fit or not to fit, that is the question

0.00 Avg rating0 Votes
Article ID: iaor2004184
Country: Netherlands
Volume: 31
Issue: 3
Start Page Number: 219
End Page Number: 224
Publication Date: May 2003
Journal: Operations Research Letters
Authors: , ,
Abstract:

We consider the open shop scheduling problem with two machines. Each job consists of two operations, and it is prescribed that the first (second) operation has to be executed by the first (second) machine. The order in which the two operations are scheduled is not fixed, but their execution intervals cannot overlap. We are interested in the question whether, for two given values D1 and D2, there exists a feasible schedule such that the first and second machine process all jobs during the intervals [0,D1] and [0,D2], respectively.

Reviews

Required fields are marked *. Your email address will not be published.