A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

DOI10.1016/0377-2217(95)00074-7zbMath0918.90081OpenAlexW2032946335MaRDI QIDQ1278236

James D. Blocher, Suresh Chand

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00074-7

zbMATH Keywords

forecast horizonchangeover schedulingforward-time branch-and-search algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Computing minimal forecast horizons: an integer programming approach ⋮ Efficient approximate algorithms for a class of dynamic lot size problems under product substitution ⋮ Modeling industrial lot sizing problems: a review ⋮ A polynomial algorithm for lot-size scheduling of two type tasks.

Cites Work

• Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• Minimum Change-Over Scheduling of Several Products on One Machine
• Optimum Production Scheduling of Multicommodity in Flow Line

This page was built for publication: A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem