Note on "parallel machine scheduling with batch setup times"

被引：4

作者：

Webster, S ^{[1
]}

机构：

[1] Syracuse Univ, Syracuse, NY 13210 USA

来源：

OPERATIONS RESEARCH | 1998年 / 46卷 / 03期

关键词：

D O I：

10.1287/opre.46.3.423

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：423 / 423

页数：1