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.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
- Controllable processing time
- Single machine
- Total weighted completion time