| Article ID: | iaor20083056 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 533 |
| End Page Number: | 540 |
| Publication Date: | Jul 2007 |
| Journal: | Operations Research Letters |
| Authors: | Ageev Alexander A., Baburin Alexei E. |
| Keywords: | heuristics |
In this paper we consider coupled-task single-machine and two-machine flow shop scheduling problems with exact delays, unit processing times, and the makespan as an objective function. The main results of the paper are fast 7/4- and 3/2-approximation algorithms for solving the single- and two-machine problems, respectively.