Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 423 |
| Number of pages | 1 |
| Journal | Operations Research |
| Volume | 46 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1998 |
| Externally published | Yes |
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research