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

J.A. Hoogeveen, S.L. Velde, van de

Research output: Contribution to journalArticleAcademicpeer-review

63 Citations (Scopus)

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 languageEnglish
Pages (from-to)205-208
Number of pages4
JournalOperations Research Letters
Volume17
Issue number5
DOIs
Publication statusPublished - 1995

Fingerprint Dive into the research topics of 'Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time'. Together they form a unique fingerprint.

Cite this