Online make-to-order joint replenishment model: Primal-dual competitive algorithms

Operations Research

Volumn 61, Issue 4, 2013, Pages 1014-1029

  Buchbinder, Niv ^a   Kimbrel, Tracy ^b   Levi, Retsef ^c   Makarychev, Konstantin ^d   Sviridenko, Maxim ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b NATIONAL SCIENCE FOUNDATION   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d MICROSOFT RESEARCH   (United States)

^e UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ALGORITHMS; DETERMINISTIC ALGORITHMS; DETERMINISTIC ONLINE ALGORITHMS; JOINT REPLENISHMENT PROBLEM; LINEAR PROGRAMMING RELAXATION; MANAGEMENT OF SUPPLY CHAINS; PRIMAL DUAL ALGORITHMS; TRADITIONAL APPROACHES;

SUPPLY CHAINS;

ALGORITHMS;

EID: 84883660271     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2013.1188     Document Type: Article

References (37)

1. Agrawal S, Wang Z, Ye Y (2009) A dynamic near-optimal algorithm for online linear programming. CoRR abs/0911.2974.
2. Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2009) The online set cover problem. SIAM J. Comput. 39(2): 361-370.
3. Arkin E, Joneja D, Roundy R (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8: 61-66.
4. Askoy Y, Erenguk SS (1988) Multi-item inventory models with coordinated replenishment: A survey. Internat. J. Oper. Production Management 8: 63-73.
5. Axsäter S (1982) Worst case performance for lot sizing heuristics. Eur. J. Oper. Res. 9(4): 339-343.
6. Bansal N, Buchbinder N, Naor J(S) (2012) A primal-dual randomized algorithm for weighted paging. J. ACM 59(4): 19.
7. Borodin A, El-Yaniv R (1998) Online Computation and Competitive Analysis (Cambridge University Press, New York).
8. Buchbinder N, Naor J (2006) Improved bounds for online routing and packing via a primal-dual approach. Proc. 47th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2006) (IEEE, Piscataway, NJ).
9. Buchbinder N, Naor J (2009a) Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2): 270-286.
10. Buchbinder N, Naor J(S) (2009b) The design of competitive online algorithms via a primal-dual approach. Foundations and Trends Theoret. Comput. Sci. 3: 93-263.
11. Buchbinder N, Jain K, Naor J(S) (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. ESA '07: Proc. 15th Annual Eur. Sympos., 253-264.
12. Dellaert NP, Melo MT (2005) Heuristic procedures for a stochastic lotsizing problem in make-to-order manufacturing. Ann. Oper. Res. 59(1): 227-258.
13. Devenur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. ACM Conf. Electronic Commerce, 71-78.
14. Dooly DR, Goldman SA, Scott SD (1998) TCP dynamic acknowledgment delay (extended abstract): Theory and practice. STOC '98: Proc. Thirtieth Annual ACM Sympos. Theory Comput. (ACM, New York). 389-398.
15. Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. ESA 1: 182-194.
16. Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J. Comput. 24: 296-317.
17. He Q-M, Jewkes EM, Buzacott J (2002) The value of information used in inventory control of a make-to-order inventory-production system. IIE Trans. 34(11): 999-1013.
18. Huh T, Levi R, Rusmevichientong P, Orlin J (2011) Adaptive data-driven inventory control policies based on Kaplan-Meier estimator. Oper. Res. 59(4): 929-941.
19. ILOG CPLEX, http://www.ilog.com/products/cplex/.
20. Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48: 274-296.
21. Karlin AR, Kenyon C, Randall D (2001) Dynamic TCP acknowledgment and other stories about e=4e.15. Algorithmica 36(3): 209-224.
22. Keskinocak P, Ravi R, Tayur S (2001) Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Management Sci. 47(2): 264-279.
23. Lan W-M, Olsen TL (2006) Multiproduct systems with both setup times and costs: Fluid bounds and schedules. Oper. Res. 54(3): 505-522.
24. Levi R, Roundy RO, Shmoys DB (2006) Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31: 267-284.
25. Levi R, Roundy RO, Shmoys DB, Sviridenko M (2008) A constant approximation algorithm for the one-warehouse multiretailer problem. Management Sci. 54(4): 763-776.
26. Liu B, Cui W, Xin C (2007) Ordering policy for perishable commodity using online algorithm with risk-reward. Proc. 2007 Internat. Conf. Intelligent Systems and Knowledge Engrg. (ISKE 2007).
27. Ma W, Wang K (2010) Optimal online risk-tolerant ordering policy for the newsvendor with forecast. J. Convergence Inform. Tech. 5(4): 54-65.
28. Nonner T, Souza A (2009) A 5/3-approximation algorithm for joint replenishment with deadlines. COCOA 24-35.
29. O'Neil S (2009) Online learning for the newsvendor problem. Master's thesis, University of Notre Dame, Notre Dame, IN.
30. O'Neil ST, Chaudhary A (2008) Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem. Proc. Tenth Workshop Algorithm Engrg. Experiments, Alenex 2008 (SIAM, Philadelphia), 49-63.
31. Sempolinski P, Chaudhary A (2010) Online algorithms for the newsvendor problem with and without censored demands. Frontiers in Algorithmics, Proc. 4th Intl. Workshop, FAW. Lecture Notes in Computer Science, Vol. 6213 (Springer, Berlin), 234-249.
32. Van den Heuvel W, Wagelmans APM (2009) Worst-case analysis for a general class of online lot-sizing heuristics. Oper. Res. 58(1): 59-67.
33. Van Hoesel S, Wagelmans A (1991) A dual algorithm for the economic lot-sizing problem. Eur. J. Oper. Res. 52: 315-325.
34. Vazirani VV (2001) Approximation Algorithms (Springer-Verlag, Berlin).
35. Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1): 25-57.
36. Wagner HM, Whitin TM (1958) Dynamic version of the economic lot sizing model. Management Sci. 5: 89-96.
37. Wagner MR (2010) Fully distribution-free profit maximization: The inventory management case. Math. Oper. Res. 35(4): 728-741.