### 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 |

State | Published - 1998 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Management Science and Operations Research

### Cite this

*Operations Research*,

*46*(3), 423.

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

Research output: Contribution to journal › Article

*Operations Research*, vol. 46, no. 3, pp. 423.

}

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 -