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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 952-961

  Buchbinder, N ^a   Kimbrel, T ^b   Levi, R ^b,c   Makarychev, K ^b   Sviridenko, M ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INVENTORY THEORY; JOINT REPLENISHMENT; JOINT REPLENISHMENT PROBLEM (JRP); LOWER BOUNDS; PRIMAL-DUAL;

COMPETITION; CONTROL THEORY; LINEARIZATION; PLANNING; SUPPLY CHAINS;

ALGORITHMS;

EID: 55349091913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The online set cover problem. In Proceedings of the 35th annual ACM Symposium on the Theory of Computation, pages 100-105, 2003.
2. E. Arkin, D. Joneja, and R. Roundy. Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8:61-66, 1989.
3. Y. Askoy and S. S. Erenguk. Multi-item inventory models with coordinated replenishment: a survey. International Journal of Operations and Production Management, 8:63-73, 1988.
4. Niv Buchbinder, Kamal Jain, and Joseph (Seffi) Naor. Online primal-dual algorithms for maximizing adauctions revenue. In 15th Annual European Symposium on Algorithms (ESA 2007), 2007.
5. Niv Buchbinder and Joseph (Seffi) Naor. Online primal-dual algorithms for covering and packing problems. In 13th Annual European Symposium on Algorithms - ESA 2005, 2005.
6. Niv Buchbinder and Joseph (Seffi) Naor. Improved Bounds for Online Routing and Packing Via a Primal- Dual Approach. In 47th annual ieee Symposium on Foundations of Computer Science (FOCS 2006), 2006.
7. N. P. Dellaertl and M. T. Melo. Heuristic procedures for a stochastic lot-sizing problem in make-toorder manufacturing. Annals of Operations Research, 59(1):227-258, 2005.
8. Daniel R. Dooly, Sally A. Goldman, and Stephen D. Scott. Tcp dynamic acknowledgment delay (extended abstract): theory and practice. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 389-398, 1998.
9. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995.
10. Qi-Ming He, E.M. Jewkes, and J. Buzacott. The value of information used in inventory control of a make-toorder inventory-production system. IIE Transactions, 34(11):999-1013, 2002.
11. S. Van Hoesel and A. Wagelmans. A dual algorithm for the economic lot-sizing problem. European Journal of Operatioms Research, 52:315-325, 1991.
12. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM 48, pages 274-296, 2001.
13. Anna R. Karlin, Claire Kenyon, and Dana Randall. Dynamic TCP acknowledgement and other stories about e/(e-1). In ACM Symposium on Theory of Computing, pages 502-509, 2001.
14. Wei-Min Lan and Tava Lennon Olsen. Multiproduct systems with both setup times and costs: Fluid bounds and schedules. Operations Research, 54(3):505-522, 2006.
15. R. Levi, R. O. Roundy, and D. B. Shmoys. Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research, 31:267-284, 2006.
16. R. Levi, R. O. Roundy, D. B. Shmoys, and M. Sviridenko. First constant approximation algorithm for the single-warehouse multi-retailer problem. To appear in Management Science, extended abstracts appeared in SODA 2005 and APPROX 2006., 2004.
17. A. Wächter and L. T. Biegler. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1):25-57, 2006.
18. H. M. Wagner and T. M. Whitin. Dynamic version of the economic lot sizing model. Management Science, 5:89-96, 1958.