A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters

DOI10.1016/j.orl.2008.12.006zbMath1159.91335OpenAlexW2133783595MaRDI QIDQ1015306

Wilco van den Heuvel, Albert P. M. Wagelmans

Publication date: 7 May 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/12548

zbMATH Keywords

heuristicslot-sizingholding cost bound

Mathematics Subject Classification ID

Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (2)

Just-in-Time Planning and Lot-Sizing ⋮ Single-item dynamic lot-sizing problems: an updated survey

Cites Work

• Unnamed Item
• Worst case performance for lot sizing heuristics
• Dynamic Version of the Economic Lot Size Model
• Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• Note—Performance Bounds for Lot Sizing Heuristics
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems

This page was built for publication: A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters