Complexity of a scheduling problem with controllable processing times
Document Type
Article
Publication Date
3-1-2010
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. © 2009 Elsevier B.V. All rights reserved.
Identifier
75949090344 (Scopus)
Publication Title
Operations Research Letters
External Full Text Location
https://doi.org/10.1016/j.orl.2009.10.011
ISSN
01676377
First Page
123
Last Page
126
Issue
2
Volume
38
Grant
KRF-2008-357-D00289
Fund Ref
National Science Foundation
Recommended Citation
Choi, Byung Cheon; Leung, Joseph Y.T.; and Pinedo, Michael L., "Complexity of a scheduling problem with controllable processing times" (2010). Faculty Publications. 6381.
https://digitalcommons.njit.edu/fac_pubs/6381
