Note on ``Parallel machine scheduling with batch setup times

DOI10.1287/OPRE.46.3.423MaRDI QIDQ2781100zbMATH OpenOpenAlexFDO

Authors Scott Webster

Publication date 31 July 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.46.3.423

zbMATH Keywords

binary NP-hardnesshigh-multiplicity encoding schemescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Recommendations

• Parallel Machine Scheduling with Batch Setup Times
• A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
• Parallel machine scheduling with high multiplicity
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Batch scheduling and common due date assignment problem: An NP-hard case

Cited in

(6)

• The complexity of scheduling job families about a common due date
• A polynomial algorithm for lot-size scheduling of two type tasks.
• Scheduling with batching: A review
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• Parallel machine scheduling with high multiplicity
• Alternative definition of the strong NP-completeness

This page was built for publication: Note on ``Parallel machine scheduling with batch setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781100)