| Article ID: | iaor19951334 |
| Country: | United States |
| Volume: | 42 |
| Issue: | 1 |
| Start Page Number: | 141 |
| End Page Number: | 145 |
| Publication Date: | Feb 1995 |
| Journal: | Naval Research Logistics |
| Authors: | Woeginger Gerhard, Kellerer Hans, Tautenhahn Thomas |
The authors present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness.