Note on parallel machine scheduling with batch setup times
成果类型：
Article
署名作者：
Webster, S
署名单位：
Syracuse University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.46.3.423
发表日期：
1998
页码：
423-423
关键词：
摘要：
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.