Abstract
We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.
Original language | English |
---|---|
Pages (from-to) | 205-208 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 17 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1995 |