Article ID: | iaor20081178 |
Country: | United States |
Volume: | 54 |
Issue: | 4 |
Start Page Number: | 789 |
End Page Number: | 800 |
Publication Date: | Jul 2006 |
Journal: | Operations Research |
Authors: | Strusevich V.A., Kubzin M.A. |
Keywords: | scheduling, heuristics |
We consider the two-machine open shop and two-machine flow shop scheduling problems in which each machine has to be maintained exactly once during the planning period, and the duration of each of these intervals depends on its start time. The objective is to minimize the maximum completion time of all activities to be scheduled. We resolve complexity and approximability issues of these problems. The open shop problem is shown to be polynomially solvable for quite general functions defining the length of the maintenance intervals. By contrast, the flow shop problem is proved binary NP-hard and pseudopolynomially solvable by dynamic programming. We also present a fully polynomial approximation scheme and a fast 3/2-approximation algorithm.