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

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

doi:10.1016/0167-6377(95)00023-D

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

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

Research School EIDMA

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	205-208
Number of pages	4
Journal	Operations Research Letters
Volume	17
Issue number	5
DOIs	https://doi.org/10.1016/0167-6377(95)00023-D
Publication status	Published - 1995

Access to Document

10.1016/0167-6377(95)00023-D

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

@article{a5732be04508468593589a50993bbd88,

title = "Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time",

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.",

author = "J.A. Hoogeveen and {Velde, van de}, S.L.",

year = "1995",

doi = "10.1016/0167-6377(95)00023-D",

language = "English",

volume = "17",

pages = "205--208",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

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

AU - Hoogeveen, J.A.

AU - Velde, van de, S.L.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

U2 - 10.1016/0167-6377(95)00023-D

DO - 10.1016/0167-6377(95)00023-D

M3 - Article

VL - 17

SP - 205

EP - 208

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -