Papers
Topics
Authors
Recent
Search
2000 character limit reached

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs

Published 24 Oct 2024 in cs.DS | (2410.18535v1)

Abstract: We study an online generalization of the classic Joint Replenishment Problem (JRP) that models the trade-off between ordering costs, holding costs, and backlog costs in supply chain planning systems. A retailer places orders to a supplier for multiple items over time: each request is for some item that the retailer needs in the future, and has an arrival time and a soft deadline. If a request is served before its deadline, the retailer pays a holding cost per unit of the item until the deadline. However, if a request is served after its deadline, the retailer pays a backlog cost per unit. Each service incurs a fixed joint service cost and a fixed item-dependent cost for every item included in a service. These fixed costs are the same irrespective of the units of each item ordered. The goal is to schedule services to satisfy all the online requests while minimizing the sum of the service costs, the holding costs, and the backlog costs. Constant competitive online algorithms have been developed for two special cases: the make-to-order version when the deadlines are equal to arrival times (Buchbinder et al., 2013), and the make-to-stock version with hard deadlines with zero holding costs (Bienkowski et al., 2014). Our general model with holding and backlog costs has not been investigated earlier, and no online algorithms are known even in the make-to-stock version with hard deadlines and non-zero holding costs. We develop a new online algorithm for the general version of online JRP with both holding and backlog costs and establish that it is 30-competitive. Along the way, we develop a 3-competitive algorithm for the single-item case that we build on to get our final result. Our algorithm uses a greedy strategy and its competitiveness is shown using a dual fitting analysis.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. When trees collide : An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3):445–456, 1995.
  2. Computational complexity of uncapacitated multi-echelon production planning problems. Operations research letters, 8(2):61–66, 1989.
  3. Online service with delay. ACM Transactions on Algorithms (TALG), 17(3):1–31, 2021.
  4. Y. Azar and N. Touitou. General framework for metric optimization problems with delay or with deadlines. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 60–71. IEEE, 2019.
  5. Latency-constrained aggregation in sensor networks. ACM Transactions on Algorithms (TALG), 6(1):1–20, 2009.
  6. Online algorithms for multilevel aggregation. Operations Research, 68(1):214–232, 2020.
  7. New results on multi-level aggregation. Theoretical Computer Science, 861:133–143, 2021.
  8. Approximation algorithms for the joint replenishment problem with deadlines. Journal of Scheduling, 18(6):545–560, 2015.
  9. Better approximation bounds for the joint replenishment problem. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, pages 42–54. SIAM, 2014.
  10. Online control message aggregation in chain networks. In Workshop on Algorithms and Data Structures, pages 133–145. Springer, 2013.
  11. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. cambridge university press, 2005.
  12. T. Bosman and N. Olver. Improved approximation algorithms for inventory problems. In International conference on integer programming and combinatorial optimization, pages 91–103. Springer, 2020.
  13. J. Bramel and D. Simchi-Levi. A location based heuristic for general routing problems. Operations research, 43(4):649–660, 1995.
  14. Competitive analysis of organization networks or multicast acknowledgment: How much to wait? Algorithmica, 64:584–605, 2012.
  15. O (depth)-competitive algorithm for online multi-level aggregation. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1235–1244. SIAM, 2017.
  16. Online make-to-order joint replenishment model: Primal-dual competitive algorithms. Operations Research, 61(4):1014–1029, 2013.
  17. The design of competitive online algorithms via a primal–dual approach. Foundations and Trends® in Theoretical Computer Science, 3(2–3):93–263, 2009.
  18. The inventory routing problem. In Fleet management and logistics, pages 95–113. Springer, 1998.
  19. The submodular joint replenishment problem. Mathematical Programming, 158:207–233, 2016.
  20. M. Chrobak. Online aggregation problems. ACM SIGACT News, 45(1):91–102, 2014.
  21. Tcp dynamic acknowledgment delay (extended abstract) theory and practice. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 389–398, 1998.
  22. On-line analysis of the tcp acknowledgment delay problem. Journal of the ACM (JACM), 48(2):243–273, 2001.
  23. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 448–455, 2003.
  24. A. Federgruen and D. Simchi-Levi. Analytical analysis of vehicle routing and inventory management problems. mo ball, tl magnanti, cl monma, gl nemhauser, eds. network routing. handbooks in or and ms, vol. 8, 1995.
  25. Deliver or hold: approximation algorithms for the periodic inventory routing problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014.
  26. A General Approximation Technique for Constrained Forest Problems. SIAM J. Comput., 24(2):296–317, 1995.
  27. Dynamic tcp acknowledgement and other stories about e/(e-1). In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 502–509, 2001.
  28. M. Khouja and S. Goyal. A review of the joint replenishment problem literature: 1989–2005. European journal of operational Research, 186(1):1–16, 2008.
  29. A constant approximation algorithm for the one-warehouse multiretailer problem. Management Science, 54(4):763–776, 2008.
  30. Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res., 31(2):267–284, 2006.
  31. R. Levi and M. Sviridenko. Improved approximation algorithm for the one-warehouse multi-retailer problem. In International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 188–199. Springer, 2006.
  32. Online multi-level aggregation with delays and stochastic arrivals. arXiv preprint arXiv:2404.09711, 2024.
  33. J. McMahan. A d𝑑ditalic_d-competitive algorithm for the multilevel aggregation problem with deadlines. arXiv preprint arXiv:2108.04422, 2021.
  34. V. Nagarajan and C. Shi. Approximation algorithms for inventory problems with submodular or routing costs. Mathematical Programming, 160:225–244, 2016.
  35. T. Nonner and A. Souza. Approximating the joint replenishment problem with deadlines. Discrete Mathematics, Algorithms and Applications, 1(02):153–173, 2009.
  36. A review of the joint replenishment problem from 2006 to 2022. Management System Engineering, 1, 11 2022.
  37. M. L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer US, 2012.
  38. A. M. Sarmiento and R. Nagi. A review of integrated analysis of production-distribution systems. IIE transactions, 31(11):1061–1074, 1999.
  39. S. S. Seiden. A guessing game and randomized online algorithms. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 592–601, 2000.
  40. P. Toth and D. Vigo. The vehicle routing problem. SIAM, 2002.
  41. N. Touitou. Improved and deterministic online service with deadlines or delay. arXiv preprint arXiv:2306.05744, 2023.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up