A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands

References

• Aggarwal A, Park J. Improved algorithms for economic lot size problems. Oper. Res. (1993) 41(3):549–571Link, Google Scholar
• Akartunalı K, Miller A. A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. (2009) 193(2):396–411Crossref, Google Scholar
• Atamtürk A, Küçükyavuz S. Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper. Res. (2005) 53(4):711–730Link, Google Scholar
• Atamtürk A, Muñoz JC. A study of the lot-sizing polytope. Math. Programming (2004) 99(3):443–465Crossref, Google Scholar
• Barany I, van Roy T, Wolsey L. Uncapacitated lot-sizing: The convex hull of solutions. Math. Programming Stud. (1984) 22:32–43Crossref, Google Scholar
• Belvaux G, Wolsey L. Bc-prod: A specialized branch-and-cut system for lot-sizing problems. Management Sci. (2000) 46(5):724–738Link, Google Scholar
• Belvaux G, Wolsey L. Modeling practical lot-sizing problems as mixed-integer programs. Management Sci. (2001) 47(7):993–1007Link, Google Scholar
• Christof T, Löbel A. PORTA—A polyhedron transformation algorithm. (2008) . Version 1.4.1. http://typo.zib.de/opt-long_projects/Software/Porta/Google Scholar
• Eppen GD, Martin RK. Solving multi-item capacitated lot-sizing problems with variable definition. Oper. Res. (1987) 35(6):832–848Link, Google Scholar
• Federgruen A, Tzur M. 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. (1991) 37(8):909–925Link, Google Scholar
• Gaglioppa F, Miller LA, Benjaafar S. Multitask and multistage production planning and scheduling for process industries. Oper. Res. (2008) 56(4):1010–1025Link, Google Scholar
• Guan Y, Ahmed S, Nemhauser GL, Miller AJ. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Programming (2006a) 105(1):55–84Crossref, Google Scholar
• Guan Y, Miller AJ, Ahmed S, Nemhauser GL. On formulations of the stochastic uncapacitated lot-sizing problem. Oper. Res. Lett. (2006b) 34(3):241–250Crossref, Google Scholar
• Krarup K, Bilde O, Collatz L. Plant location, set covering and economic lot-sizes: An O(mn) algorithm for structured problems. Optimierung bei Graphentheoretischen und Ganzzahligen Probleme (1977) (Birkhauser Verlag, Basel, Switzerland) 155–180Crossref, Google Scholar
• Küçükyavuz S, Pochet Y. Uncapacitated lot sizing with backlogging: The convex hull. Math. Programming (2009) 118(1):151–175Crossref, Google Scholar
• Lee C, Çetinkaya S, Jaruphongsa W. A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. (2003) 51(5):735–747Link, Google Scholar
• Love S. A facilities in series inventory model with nested schedules. Management Sci. (1972) 18(5):327–338Link, Google Scholar
• Martin R. Generating alternative mixed-integer programming models using variable redefinition. Oper. Res. (1987) 35(6):820–831Link, Google Scholar
• Melo R, Wolsey L. Uncapacitated two-level lot-sizing. Oper. Res. Lett. (2010) 38(4):241–245Crossref, Google Scholar
• Pochet Y, Wolsey L. Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Programming (1988) 40(1):317–335Crossref, Google Scholar
• Pochet Y, Wolsey L. Production Planning by Mixed Integer Programming (2006) (Springer-Verlag)Google Scholar
• Pochet Y, Wolsey LA. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18(4):767–785Link, Google Scholar
• Rardin R, Wolsey L. Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. (1993) 71(1):95–109Crossref, Google Scholar
• Stadtler H. Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. (2003) 51(3):487–502Link, Google Scholar
• van Hoesel S, Romeijn HE, Morales DR, Wagelmans A. Integrated lot sizing in serial supply chains with production capacities. Management Sci. (2005) 51(11):1706–1719Link, Google Scholar
• Veinott AF. Minimum concave-cost solution of Leontief substitution models of multi-facility inventory systems. Oper. Res. (1969) 17(2):262–291Link, Google Scholar
• Wagelmans A, Van Hoesel S, Kolen A. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. (1992) 40(1):S145–S156Link, Google Scholar
• Wagner H, Whitin T. Dynamic version of the economic lot size problem. Management Sci. (1958) 5(1):89–96Link, Google Scholar
• Wolsey L. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Sci. (2002) 48(12):1587–1602Link, Google Scholar
• Wolsey LA. Integer Programming (1998) (John Wiley and Sons, New York) Google Scholar
• Zangwill W. A backlogging model and a multiechelon model of a dynamic economic lot size production system—A network approach. Management Sci. (1969) 15(9):506–527Link, Google Scholar
• Zangwill WI. Minimum concave cost flows in certain networks. Management Sci. (1968) 14(7):429–450Link, Google Scholar