Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

J. A. Hoogeveen, Steef L. van de Velde. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett., 17(5):205-208, 1995. [doi]

No reviews for this publication, yet.