Complexity of a scheduling problem with controllable processing times

Authors:
Byung-Cheon Choi;Joseph Y. -T. Leung;Michael L. Pinedo
Affiliations:
Department of Business, Chungnam National University, 79 Daehakro, Yuseong-gu Daejeon 305-764, Republic of Korea;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 0

Some comments on sequencing with controllable processing times

Computing
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A survey of scheduling with controllable processing times

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.