| Article ID: | iaor1997287 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 5 |
| Start Page Number: | 205 |
| End Page Number: | 208 |
| Publication Date: | Jun 1995 |
| Journal: | Operations Research Letters |
| Authors: | Velde S.L. van de, Hoogeveen J.A. |
The authors prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. The result settles a slong-standing open problem.