A fast heuristic for minimising total average cycle stock subject to practical constraints

DOI10.1057/PALGRAVE.JORS.2600775zbMath1054.90516OpenAlexW1997879844MaRDI QIDQ3157385

Edward A. Silver, Il-Kyeong Moon

Publication date: 13 January 2005

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

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

zbMATH Keywords

dynamic programminginventoryheuristiccycle stock

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (2)

A disjunctive cut strengthening technique for convex MINLP ⋮ Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research

This page was built for publication: A fast heuristic for minimising total average cycle stock subject to practical constraints