Heuristic Methods for the Multi-product Dynamic Lot Size Problem

DOI10.1057/jors.1991.169zbMath0737.90018OpenAlexW2042637403MaRDI QIDQ3983499

Paul Iyogun

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1057/jors.1991.169

zbMATH Keywords

joint replenishment problemSilver-Meal heuristicmulti-product dynamic lot-sizepart balancing heuristicworst case performances

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ A review of the joint replenishment problem literature: 1989--2005 ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem

This page was built for publication: Heuristic Methods for the Multi-product Dynamic Lot Size Problem