Note on “Parallel Machine Scheduling with Batch Setup Times” | Zendy

Scott Webster | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Note on “Parallel Machine Scheduling with Batch Setup Times”

Author(s) -

Scott Webster

Publication year - 1998

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.46.3.423

Subject(s) - computer science , inference , scheduling (production processes) , binary number , multiplicity (mathematics) , job shop scheduling , mathematical optimization , chen , algorithm , parallel computing , mathematics , artificial intelligence , arithmetic , mathematical analysis , paleontology , schedule , biology , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research