Complexity of a scheduling problem with controllable processing times

✍ Scribed by Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 766 KB
• Volume: 38
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2009.10.011

✦ Synopsis

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.