Article ID: | iaor19941716 |
Country: | United States |
Volume: | 19 |
Issue: | 1 |
Start Page Number: | 68 |
End Page Number: | 85 |
Publication Date: | Feb 1994 |
Journal: | Mathematics of Operations Research |
Authors: | Hall Leslie A. |
Keywords: | scheduling |
The paper presents a polynomial approximation scheme for a two-machine flow shop scheduling problem with the additional constraint that each job has a release date, when it first becomes available for processing. This is one of the first such results for multiple-task scheduling problems; previously, the best approximation result for this problem was an algorithm guaranteed to deliver a schedule of length at most 5/3 times the optimal length. The present (1+