A polynomial algorithm for lot-size scheduling of two type tasks
Information Processing Letters
The complexity of scheduling job families about a common due date
Operations Research Letters
| Hi-index | 0.00 |
Cheng and Chen (1994) use a high-multiplicity encoding scheme to prove binary NP-hardness of a scheduling problem. From this they infer a similar result for a well-known, more general problem. We explain that, although their initial proof is correct, their inference about the more general problem is not.