Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints

References

• Aggarwal A, Park JK (1993) Improved algorithm for economic lot-size problems. Oper. Res. 41(3):549–571.Link, Google Scholar
• Akbalik A, Rapine C (2012) Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost. Oper. Res. Lett. 40(5):390–397.Crossref, Google Scholar
• Aksoy Y, Erenguc SS (1998) Multi-item inventory models with co-ordinated replenishments: A survey. Internat. J. Oper. Production Management 8(1):63–73.Crossref, Google Scholar
• Arkin E, Joneja D, Roundy R (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8:61–66.Crossref, Google Scholar
• Bellman R (1958) On a routing problem. Quart. Appl. Math. 16(1):87–90.Crossref, Google Scholar
• Bienkowski M, Byrka J, Chrobak M, Jeż Ł, Nogneng D, Sgall J (2014) Better approximation bounds for the joint replenishment problem. Chekuri C, ed. Proc. Twenty-Fifth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’14 (SIAM, Philadelphia), 42–54.Crossref, Google Scholar
• Bienkowski M, Byrka J, Chrobak M, Dobbs N, Nowicki T, Sviridenko M, Świrszcz G, Young NE (2013) Approximation algorithms for the joint replenishment problem with deadlines. Automata, Languages, and Programming (Springer, Berlin), 135–147.Crossref, Google Scholar
• Bitran G, Yanasse H (1982) Computational complexity of the capacitated lot size problem. Management Sci. 28(10):1174–1185.Link, Google Scholar
• Brahimi N, Dauzère-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur. J. Oper. Res. 168(1):1–16.Crossref, Google Scholar
• Chan LMA, Muriel A, Shen ZJM, Simchi-Levi D, Teo CP (2000) Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. 48(11):1446–1460.Link, Google Scholar
• Federgruen A, Tzur M (1991) A simple forward algorithm to solve the general dynamic lot-sizing models with n periods in o(n log n) or o(n) time. Management Sci. 37(8):909–925.Link, Google Scholar
• Federgruen A, Tzur M (1999) Time-partitioning heuristics: Application to one-warehouse, multi-item, multi-retailer lot-sizing problems. Naval Res. Logist. 46(5):463–486.Crossref, Google Scholar
• Federgruen A, Wang M (2015) Inventory models with shelf age and delay dependent inventory costs. Oper. Res. 63(3):701–715.Link, Google Scholar
• Feige U (1998) A threshold of log(n) for approximating set-cover. J. ACM 45(4):634–652.Crossref, Google Scholar
• Florian M, Klein M (1971) Deterministic production planning with concave costs and capacity constraints. Management Sci. 18(1):12–20.Link, Google Scholar
• Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Management Sci. 26(7):669–679.Link, Google Scholar
• Gayon JP, Massonnet G, Rapine C, Stauffer G (2016) Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. Eur. J. Oper. Res. 250(1):155–163.Crossref, Google Scholar
• Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989–2005. Eur. J. Oper. Res. 186(1):1–16.Crossref, Google Scholar
• Levi R, Lodi A, Sviridenko M (2008) Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33(2):461–474.Link, Google Scholar
• Levi R, Roundy R, Shmoys D (2006) Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2):267–284.Link, Google Scholar
• Levi R, Roundy R, Shmoys D, Sviridenko M (2008) A constant approximation algorithm for the one-warehouse multiretailer problem. Management Sci. 54(8):763–776.Link, Google Scholar
• Li CL, Hsu V, Xiao WQ (2004) Dynamic lot sizing with batch ordering and truckload discounts. Oper. Res. 52(4):639–654.Link, Google Scholar
• Muckstadt J, Roundy R (1993) Analysis of multistage production systems. Logistics of Production and Inventory of Handbooks in OR and MS, Vol. 4, Chapter 2 (North Holland, Amsterdam), 59–131.Crossref, Google Scholar
• Nonner T, Souza A (2009) A 5/3-approximation algorithm for joint replenishment with deadlines. Du D-Z, Hu X, Pardalos PM, eds. Proc. Third Internat. Conf. Combinatorial Optim. Appl., COCOA ’09 (Springer, Berlin), 24–35.Crossref, Google Scholar
• Nonner T, Sviridenko M (2013) An efficient polynomial-time approximation scheme for the joint replenishment problem. Goemans MX, Correa JR, eds. Proc. 16th Conf. Integer Programming Combinatorial Optim., IPCO ’13 (Springer, Berlin), 314–323.Crossref, Google Scholar
• Pochet Y, Wolsey L (2006) Production Planning by Mixed Integer Programming (Springer, Berlin).Google Scholar
• Roundy R (1985) A 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. 31(11):1416–1430.Link, Google Scholar
• Schwarz LB (1973) A simple continuous review deterministic one-warehouse n-retailer inventory problem. Management Sci. 19(5):555–566.Link, Google Scholar
• Shen ZJ, Shu J, Simchi-Levi D, Teo CP, Zhang J (2009) Approximation algorithms for general one-warehouse multi-retailer systems. Naval Res. Logist. 56(7):642–658.Crossref, Google Scholar
• Stauffer G (2012) Using the economical order quantity formula for inventory control in one-warehouse multiretailer systems. Naval Res. Logist. 59(3-4):285–297.Crossref, Google Scholar
• Stauffer G (2016) Constant factor approximation algorithms for deterministic k-echelon inventory control in pure distribution networks. Technical Report GSCOP-STA-16-1, Grenoble Institute of Technology (Grenoble INP), Grenoble, France.Google Scholar
• Stauffer G, Massonnet G, Rapine C, Gayon JP (2011) A simple and fast 2-approximation for the one-warehouse multi-retailers problem. Randall D, ed. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’11 (SIAM, Philadelphia), 67–79.Crossref, Google Scholar
• van Hoesel C, Wagelmans A (1996) An 𝒪(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. 42(1):142–150.Link, Google Scholar
• van Hoesel S, Romeijn HE, Morales DR, Wagelmans A (2005) Integrated lot-sizing in serial supply chains with production capacities. Management Sci. 51(11):1706–1719.Link, Google Scholar
• Van Vyve M (2007) Algorithms for single-item lot-sizing problems with constant batch size. Math. Oper. Res. 32(3):594–613.Link, Google Scholar
• Wagelmans A, Van Hoesel C, Kolen A (1992) Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40(S1):145–156.Link, Google Scholar
• Wagner H, Whitin T (1958) Dynamic version of the economic lot size problem. Management Sci. 5(1):89–96.Link, Google Scholar
• Zipkin P (2000) Foundations of Inventory Control (McGraw-Hill/Irwin, New York).Google Scholar