Online make-to-order joint replenishment model: primal-dual competitive algorithms
From MaRDI portal
Publication:5166263
DOI10.1287/OPRE.2013.1188zbMATH Open1291.90010OpenAlexW2136115647MaRDI QIDQ5166263FDOQ5166263
Retsef Levi, Tracy Kimbrel, Maxim Sviridenko, Niv Buchbinder, Konstantin Makarychev
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://pubsonline.informs.org/doi/abs/10.1287/opre.2013.1188
Recommendations
Cited In (11)
- Coordinated maintenance in a multi-component system with compound Poisson deterioration
- Multi-Priority Online Scheduling with Cancellations
- Coordinated replenishment game and learning under time dependency and uncertainty of the parameters
- Primal-Dual Algorithms for Deterministic Inventory Problems
- An online joint replenishment problem combined with single machine scheduling
- Caching with Time Windows and Delays
- Improved and deterministic online service with deadlines or delay
- Joint replenishment meets scheduling
- Supply Chain Management with Online Customer Selection
- Online economic ordering problem for deteriorating items with limited price information
- An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller
This page was built for publication: Online make-to-order joint replenishment model: primal-dual competitive algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166263)