The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm

DOI10.1287/opre.47.4.559zbMath0979.90050OpenAlexW2087448271MaRDI QIDQ2770123

James D. Blocher, Kaushik Sengupta, Suresh Chand

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-bound algorithmmultiproduct discrete-item manufacturing environmentscheduling multiple productsingle-finite-capacity resource

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Scheduling with few changes ⋮ Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity ⋮ Modeling industrial lot sizing problems: a review ⋮ Modeling of period overlapping setup times