Note on "parallel machine scheduling with batch setup times"

Research output: Contribution to journalArticle

4 Citations (Scopus)

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

Fingerprint

Hardness
Scheduling
NP-hardness
Setup times
Inference
Multiplicity
Batch
Parallel machine scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Note on "parallel machine scheduling with batch setup times". / Webster, Scott.

In: Operations Research, Vol. 46, No. 3, 1998, p. 423.

Research output: Contribution to journalArticle

@article{eed1ef14479941d9b5450c5e2f4e7525,
title = "Note on {"}parallel machine scheduling with batch setup times{"}",
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.",
author = "Scott Webster",
year = "1998",
language = "English (US)",
volume = "46",
pages = "423",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

TY - JOUR

T1 - Note on "parallel machine scheduling with batch setup times"

AU - Webster, Scott

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0005890348&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0005890348&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0005890348

VL - 46

SP - 423

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 3

ER -