Multiechelon Lot Sizing: New Complexities and Inequalities

References

• Aggarwal A, Park J (1993) Improved algorithms for economic lot size problems. Oper. Res. 41(3):549–571.Link, Google Scholar
• Ahmed S, He Q, Li S, Nemhauser G (2016) On the computational complexity of minimum-concave-cost flow in a two–dimensional grid. SIAM J. Optim. 26(4):2059–2079.Crossref, Google Scholar
• Akartunalı K, Fragkos I, Miller AJ, Wu T (2016) Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS J. Comput. 28(4):766–780.Link, Google Scholar
• Atamtürk A, Küçükyavuz S (2005) Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper. Res. 53(4):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
• Atamtürk A, Muñoz JC (2004) A study of the lot–sizing polytope. Math. Programming 99(3):43–65.Crossref, Google Scholar
• Barany I, van Roy T, Wolsey L (1984) Uncapacitated lot-sizing: The convex hull of solutions. Math. Programming Study 22:32–43.Crossref, Google Scholar
• Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Management Sci. 28(10):1174–1186.Link, Google Scholar
• Federgruen A, Tzur M (1991) A simple forward algorithm to solve 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
• 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
• Fragkos I, Degraeve Z, Reyck BD (2016) A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J. Comput. 28(3):465–482.Link, Google Scholar
• Gaglioppa F, Miller LA, Benjaafar S (2008) Multitask and multistage production planning and scheduling for process industries. Oper. Res. 56(4):1010–1025.Link, Google Scholar
• Günlük O, Pochet Y (2001) Mixing mixed-integer inequalities. Math. Programming 90(3):429–457.Crossref, Google Scholar
• He Q, Ahmed S, Nemhauser G (2015) Minimum concave cost flow over a grid network. Math. Programming 150(1):79–98.Crossref, Google Scholar
• Hwang H (2010) Economic lot-sizing for integrated production and transportation. Oper. Res. 58(2):428–444.Link, Google Scholar
• Hwang H, Ahn H, Kaminsky P (2013) Basis paths and a polynomial algorithm for the multistage 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(11):1065–1075.Crossref, Google Scholar
• Krarup K, Bilde O, Collatz L, ed. (1977) Plant location, set covering and economic lot-sizes: an O(mn) algorithm for structured problems. Optimierung bei Graphentheoretischen und Ganzzahligen Probleme (Birkhauser, Basel, Switzerland), 155–179.Crossref, Google Scholar
• Küçükyavuz S, Pochet Y (2009) Uncapacitated lot sizing with backlogging: the convex hull. Math. Programming 118(1):151–175.Crossref, Google Scholar
• Lee C, Çetinkaya S, Jaruphongsa W (2003) A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51(5):735–747.Link, Google Scholar
• Love S (1972) A facilities in series inventory model with nested schedules. Management Sci. 18(5):327–338.Link, Google Scholar
• Melo R, Wolsey L (2010) Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38:241–245.Crossref, Google Scholar
• Pochet Y, Wolsey L (2006) Production Planning by Mixed Integer Programming (Springer, New York).Google Scholar
• Pochet Y, Wolsey LA (1993) Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. 18(4):767–785.Link, Google Scholar
• Rardin R, Wolsey L (1993) Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71(1):95–109.Crossref, Google Scholar
• van Hoesel C, Wagelmans A (1996) An o(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
• Van Vyve M, Wolsey LA, Yaman H (2014) Relaxations for two-level multi-item lot-sizing problems. Math. Programming 146(1–2):495–523.Crossref, Google Scholar
• Wagelmans A, Van Hoesel S, 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(1):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
• Zangwill W (1969) A backlogging model and a multiechelon model of a dynamic economic lot size production system—A network approach. Management Sci. 15(9):506–527.Link, Google Scholar
• Zhang M, Küçükyavuz S, Yaman H (2012) A polyhedral study of multiechelon lot sizing with intermediate demands. Oper. Res. 60(4):918–935.Link, Google Scholar