Article ID: | iaor20013923 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 1 |
Start Page Number: | 116 |
End Page Number: | 121 |
Publication Date: | Jan 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Formanowicz P., Espinouse M.-L., Penz B. |
Keywords: | flowshop |
The scheduling problems studied in this paper concern a two-machine no-wait flow shop problem with limited machine availability. In this model, we assume that machines may not always be available, for example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in advance. The objective function considered is the maximum completion time (