On the power of lookahead in online lot-sizing

DOI10.1016/j.orl.2010.09.010zbMath1202.90024OpenAlexW2094220892MaRDI QIDQ614030

Harri Haanpää, André Schumacher, Lauri Ahlroth

Publication date: 23 December 2010

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

Full work available at URL: https://doi.org/10.1016/j.orl.2010.09.010

zbMATH Keywords

competitive analysisonline algorithmlot-sizinglookahead

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Online algorithms; streaming algorithms (68W27)

Related Items

An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand

Cites Work

• Unnamed Item
• Unnamed Item
• A competitive analysis of the list update problem with lookahead
• Worst case performance for lot sizing heuristics
• On the influence of lookahead in competitive paging algorithms
• Dynamic Version of the Economic Lot Size Model
• Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
• Note—Performance Bounds for Lot Sizing Heuristics
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Computing and Combinatorics