Some Comments on Sequencing with Controllable Processing Times

H. Hoogeveen, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

44 Citations (Scopus)


We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.
Original languageEnglish
Pages (from-to)181-192
Publication statusPublished - 2002
Externally publishedYes


  • METIS-208611

Fingerprint Dive into the research topics of 'Some Comments on Sequencing with Controllable Processing Times'. Together they form a unique fingerprint.

Cite this