Note on “Parallel Machine Scheduling with Batch Setup Times”

DOI10.1287/opre.46.3.423zbMath0996.90046OpenAlexW2098182316MaRDI QIDQ2781100

Webster, Scott

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

schedulingbinary NP-hardnesshigh-multiplicity encoding scheme

Mathematics Subject Classification ID

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

Related Items (4)

The complexity of scheduling job families about a common due date ⋮ Scheduling with batching: A review ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ A polynomial algorithm for lot-size scheduling of two type tasks.

This page was built for publication: Note on “Parallel Machine Scheduling with Batch Setup Times”