MINIMIZING TOTAL COMPLETION-TIME AND MAXIMUM COST SIMULTANEOUSLY IS SOLVABLE IN POLYNOMIAL-TIME

Authors
HOOGEVEEN JA VANDEVELDE SL
Citation
Ja. Hoogeveen et Sl. Vandevelde, MINIMIZING TOTAL COMPLETION-TIME AND MAXIMUM COST SIMULTANEOUSLY IS SOLVABLE IN POLYNOMIAL-TIME, Operations research letters, 17(5), 1995, pp. 205-208
Citations number
11
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
17
Issue
5
Year of publication
1995
Pages
205 - 208
Database
ISI
SICI code
0167-6377(1995)17:5<205:MTCAMC>2.0.ZU;2-#
Abstract
We prove that the bicriteria single-machine scheduling problem of mini mizing total completion time and maximum cost simultaneously is solvab le in polynomial time. Our result settles a long-standing open problem .