Complexity of a scheduling problem with controllable processing times

Byung Cheon Choi, Joseph Y.T. Leung, Michael L. Pinedo

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We consider the problem of scheduling a set of independent jobs on a single machine so as to minimize the total weighted completion time, subject to the constraint that the total compression cost is less than or equal to a fixed amount. The complexity of this problem is mentioned as an open problem. In this note we show that the problem is NP-hard.

Original languageEnglish (US)
Pages (from-to)123-126
Number of pages4
JournalOperations Research Letters
Issue number2
StatePublished - Mar 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


  • Controllable processing time
  • NP-hard
  • Single machine
  • Total weighted completion time


Dive into the research topics of 'Complexity of a scheduling problem with controllable processing times'. Together they form a unique fingerprint.

Cite this