Approximation Algorithms for Scheduling Problems with Exact Delays
We give first constant-factor approximations for various cases of the coupled-task single machine and two-machine flow shop scheduling problems with exact delays and makespan as the objective function. In particular, we design 3.5- and 3-approximation algorithms for the general cases of the single-machine and the two-machine problems, respectively. We also prove that the existence of a (2−ε)-approximation algorithm for the single-machine problem as well as the existence of a (1.5−ε)-approximation algorithm for the two-machine problem implies P=NP. The inapproximability results are valid for the cases when the operations of each job have equal processing times and for these cases the approximation ratios achieved by our algorithms are very close to best possible: we prove that the single machine problem is approximable within a factor of 2.5 and the two-machine problem is approximable within a factor of 2.
KeywordsApproximation Algorithm Completion Time Approximation Ratio Single Machine Feasible Schedule
Unable to display preview. Download preview PDF.
- 1.Ageev, A.A., Baburin, A.E.: Approximation Algorithms for the Single and Two-Machine Scheduling Problems with Exact Delays. To appear in Operations Research LettersGoogle Scholar
- 9.Yu, W.: The two-machine shop problem with delays and the one-machine total tardiness problem, Ph.D. thesis, Technische Universiteit Eindhoven (1996)Google Scholar