| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1134913 | Computers & Industrial Engineering | 2010 | 4 Pages |
Abstract
The computational complexity of scheduling jobs with released dates on an unbounded batch processing machine to minimize total completion time and on parallel unbounded batch processing machines to minimize total weighted completion time remains open. In this note we show that the first problem is NP-hard with respect to id-encoding, and the second one is strongly NP-hard.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
L.L. Liu, C.T. Ng, T.C.E. Cheng,