Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

DOI10.1016/0377-2217(93)90081-WzbMath0777.90013MaRDI QIDQ1261343

Moustapha Diaby

Publication date: 4 October 1993

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

zbMATH Keywords

branch-and-boundproduction planningdynamic lot-sizing problempost-optimization analysis

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches

Cites Work

• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Facets and algorithms for capacitated lot sizing
• Dynamic Version of the Economic Lot Size Model
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources

This page was built for publication: Efficient post-optimization analysis procedure for the dynamic lot-sizing problem