A two-phase algorithm for rolling batch planning based on simulated annealing

MaRDI QIDQ2725091zbMATH OpenFDO

Authors Xiong Chen, Xinhe Xu

Publication date 7 August 2002

Published in Control Theory \& Applications (Search for Journal in Brave)

zbMATH Keywords

dynamical programmingheuristicsrolling batch planningsimulated annealingvehicle routing problem

Mathematics Subject Classification ID

Production models (90B30) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Simulated annealing and joint manufacturing batch-sizing
• Modeling rolling batch planning as vehicle routing problem with time windows.
• Model and algorithm for solving hot strip rolling batch planning problems
• Rolling horizon scheduling in a rolling-mill
• Modeling and application for rolling scheduling problem based on TSP

Cited in

(4)

• Modeling rolling batch planning as vehicle routing problem with time windows.
• A simulated annealing algorithm for aggregate production planning with considering of ancillary costs
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Simulated annealing and joint manufacturing batch-sizing

This page was built for publication: A two-phase algorithm for rolling batch planning based on simulated annealing

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