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

Share/Save/Bookmark

Hoogeveen, J.A. and Velde van de, S.L. (1995) Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 17 (5). pp. 205-208. ISSN 0167-6377

[img]
Preview
PDF
306Kb
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.
Item Type:Article
Copyright:© 1995 Elsevier Science
Link to this item:http://purl.utwente.nl/publications/32285
Official URL:http://dx.doi.org/10.1016/0167-6377(95)00023-D
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144538