| Article ID: | iaor20002077 |
| Country: | Netherlands |
| Volume: | 5 |
| Issue: | 1 |
| Start Page Number: | 5 |
| End Page Number: | 28 |
| Publication Date: | Mar 1999 |
| Journal: | Journal of Heuristics |
| Authors: | Dekker Rommert, Strusevich V.A., Waart A.J.A. Van De |
This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3/2.