A combined heuristic approach to dynamic lot sizing problems

DOI10.1080/00207548908942675zbMath0682.90031OpenAlexW2139635048WikidataQ56967362 ScholiaQ56967362MaRDI QIDQ4732282

Ali S. Kiran

Publication date: 1989

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548908942675

zbMATH Keywords

dynamic lot sizingworst case performancecombined heuristic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Cites Work

• Worst case performance for lot sizing heuristics
• Dynamic Version of the Economic Lot Size Model
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• Note—Performance Bounds for Lot Sizing Heuristics
• Worst-Case Analysis of Heuristic Algorithms

This page was built for publication: A combined heuristic approach to dynamic lot sizing problems