Multilevel Lot-Sizing with Inventory Bounds

References

• Aggarwal A, Park JK (1993) Improved algorithms for economic lot-size problems. Oper. Res. 41(3):549–571.Link, Google Scholar
• Ahmed S, He Q, Li S, Nemhauser GL (2016) On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. SIAM J. Optim. 26:2059–2079.Crossref, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Atamtürk A, Küçükyavuz S (2005) Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper. Res. 53:711–730.Link, Google Scholar
• Atamtürk A, Küçükyavuz S (2008) An O(n2) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36(3):297–299.Crossref, Google Scholar
• Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Management Sci. 28:1174–1186.Link, Google Scholar
• Chung CS, Lin CHM (1988) An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. 34:420–426.Link, Google Scholar
• Dauzère-Pérès S, Nordli A, Olstad A, Haugen K, Koester U, Per Olav M, Teistklub G, et al. (2007) Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 37(1):39–51.Link, Google Scholar
• Federgruen A, Tzur M (1991) A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlogn) or O(n) time. Management Sci. 37:909–925.Link, Google Scholar
• Florian M, Klein M (1971) Deterministic procurement planning with concave costs and capacity constraints. Management Sci. 26:669–679.Link, Google Scholar
• He Q, Ahmed S, Nemhauser GL (2015) Minimum concave cost flow over a grid network. Math. Programming 150:79–98.Crossref, Google Scholar
• Hwang HC, van den Heuvel W (2012) Improved algorithms for lot-sizing problem with bounded inventory and backlogging. Naval Res. Logist. 59:244–253.Crossref, Google Scholar
• Hwang HC, Ahn H, Kaminsky P (2013) Basis paths and a polynomial algorithm for the multi-level production-capacitated lot-sizing problem. Oper. Res. 61(2):469–482.Link, Google Scholar
• Kaminsky P, Simchi-Levi D (2003) Production and distribution lot sizing in a two stage supply chain. IIE Trans. 35:1065–1075.Crossref, Google Scholar
• Lee CY, Çetinkaya S, Jaruphongsa W (2003) A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51:735–747.Link, Google Scholar
• Levi R, Yedidsion L (2013) Np-hardness proof for the assembly problem with stationary setup and additive holding costs. Oper. Res. Lett. 41(2):134–137.Crossref, Google Scholar
• Love SF (1972) A facilities in series inventory model with nested schedules. Management Sci. 18:327–338.Link, Google Scholar
• Love SF (1973) Bounded production and inventory models with piecewise concave costs. Management Sci. 20:313–318.Link, Google Scholar
• Melo RA, Wolsey LA (2010) Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38:241–245.Crossref, Google Scholar
• Phouratsamay SL, Kedad-Sidhoum S, Pascual F (2018) Two-level lot-sizing with inventory bounds. Discrete Optim. 30:1–19.Crossref, Google Scholar
• Sargut FZ, Romeijn HE (2007) Lot-sizing with non-stationary cumulative capacities. Oper. Res. Lett. 35(4):549–557.Crossref, Google Scholar
• Silver EA, Pyke DF, Peterson R (1998) Inventory Management and Production Planning and Scheduling, vol. 3 (Wiley, New York).Google Scholar
• van den Heuvel W, Wagelmans APM (2008) A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters. Technical report EI 2008-10, Econometric Institute, Erasmus University, Rotterdam, Netherlands.Google Scholar
• van Hoesel CPM, Wagelmans APM (1996) An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. 42:142–150.Link, Google Scholar
• van Hoesel CPM, Romeijn HE, Morales DR, Wagelmans APM (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:594–613.Link, Google Scholar
• Wagelmans APM, van Hoesel CPM, Kolen A (1992) Economic lot sizing: An O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40:S145–S156.Link, Google Scholar
• Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5:89–96.Link, Google Scholar
• Wolsey LA (2006) Lot-sizing with production and delivery time windows. Math. Programming Ser. A 107:471–489.Crossref, Google Scholar
• Zangwill WI (1969) A backlogging model and multi-echelon model of a dynamic economic lot size production system: A network approach. Management Sci. 15:506–527.Link, Google Scholar
• Zhao M, Zhang M (2020) Multiechelon lot sizing: New complexities and inequalities. Oper. Res. 68(2):534–551.Abstract, Google Scholar