On the power of lookahead in online lot-sizing

DOI10.1016/J.ORL.2010.09.010MaRDI QIDQ614030zbMATH OpenOpenAlexFDO

Authors Lauri Ahlroth, André Schumacher, Harri Haanpää

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 analysislookaheadlot-sizingonline algorithm

Mathematics Subject Classification ID

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

Recommendations

• Online machine minimization with lookahead
• scientific article; zbMATH DE number 910900
• On the power of lookahead in on-line server routing problems
• How much can lookahead help in online single machine scheduling
• A competitive analysis of the list update problem with lookahead

Cites work

• A competitive analysis of the list update problem with lookahead
• Computing and Combinatorics
• Dynamic version of the economic lot size model
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• Note—Performance Bounds for Lot Sizing Heuristics
• On the influence of lookahead in competitive paging algorithms
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Worst case performance for lot sizing heuristics
• Worst-case analysis for a general class of online lot-sizing heuristics

Cited in

(4)

• Exact distributional analysis of online algorithms with lookahead
• Computing and Combinatorics
• 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

This page was built for publication: On the power of lookahead in online lot-sizing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614030)