Article ID: | iaor20031865 |
Country: | United Kingdom |
Volume: | 53 |
Issue: | 11 |
Start Page Number: | 1239 |
End Page Number: | 1246 |
Publication Date: | Nov 2002 |
Journal: | Journal of the Operational Research Society |
Authors: | Billaut Jean-Charles, Lorigeon T., Bouquard J.-L. |
Keywords: | programming: dynamic, programming: integer |
This paper studies a two-machine open shop scheduling problem with an availability constraint, i.e. we assume that a machine is not always available and that the processing of the interrupted job can be resumed when the machine becomes available again. We consider the makespan minimization as criterion. This problem is NP-hard. We develop a pseudo-polynomial time dynamic programming algorithm to solve the problem optimally when the machine is not available at time