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]

Authors

J. A. Hoogeveen

This author has not been identified. Look up 'J. A. Hoogeveen' in Google

Steef L. van de Velde

This author has not been identified. Look up 'Steef L. van de Velde' in Google