Note on "parallel machine scheduling with batch setup times"

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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 languageEnglish (US)
Pages (from-to)423
Number of pages1
JournalOperations Research
Issue number3
StatePublished - 1998
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Note on "parallel machine scheduling with batch setup times"'. Together they form a unique fingerprint.

Cite this