Article ID Journal Published Year Pages File Type
1142605 Operations Research Letters 2010 4 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Complexity of a scheduling problem with controllable processing times
Authors
, , ,