| Article ID: | iaor1995528 |
| Country: | Netherlands |
| Volume: | 14 |
| Issue: | 5 |
| Start Page Number: | 245 |
| End Page Number: | 250 |
| Publication Date: | Dec 1993 |
| Journal: | Operations Research Letters |
| Authors: | Werner Frank, Brucker Peter, Jurisch Bernd, Tautenhahn Thomas |
| Keywords: | programming: dynamic |
The authors present a polynomial algorithm for the problem of scheduling an open shop with unit time operations for a fixed number of machines such that the weighted number of late jobs is minimized. The algorithm is based on dynamic programming. The complexity of this problem was unknown for open shops with more than two machines.