An improved heuristic for the capacitated lot-sizing problem

DOI10.1504/IJOR.2010.029519MaRDI QIDQ1042705zbMATH OpenFDO

Authors J. Blot

Publication date 7 December 2009

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsmixed integer programmingproduction planningfixed charge transportationcapacitated lot sizing

Mathematics Subject Classification ID

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

Recommendations

• An effective heuristic for the CLSP with set-up times
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Solving the capacitated lot-sizing problem with backorder consideration
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• The capacitated lot-sizing problem with linked lot sizes

Cited in

(10)

• An effective heuristic for the CLSP with set-up times
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• The capacitated lot-sizing problem with linked lot sizes
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A heuristic procedure for the capacitated lot sizing problem with setup carry-over
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods

This page was built for publication: An improved heuristic for the capacitated lot-sizing problem

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