Transportation and Inventory Planning in Serial Supply Chain with Heterogeneous Capacitated Vehicles

References

• Aggarwal A, Park JK (1993) Improved algorithms for economic lot size problems. Oper. Res. 41(3):549–571.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Inc., Englewood Cliffs, NJ).Google Scholar
• Atamtürk A, Hochbaum DS (2001) Capacity acquisition, subcontracting, and lot sizing. Management Sci. 47(8):1081–1100.Link, Google Scholar
• Bansal M (2019) Facets for single module and multi-module capacitated lot-sizing problems without backlogging. Discrete Appl. Math. 255:117–141.Crossref, Google Scholar
• Bansal M, Kianfar K (2014) n-step cycle inequalities: Facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem. Lee J, Vygen J, eds. Integer Programming and Combinatorial Optimization. IPCO 2014 (Springer, Cham, Switzerland), 102–113.Crossref, Google Scholar
• Bansal M, Kianfar K (2015) n-step cycle inequalities: Facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. Math. Programming 154(1):113–144.Crossref, Google Scholar
• Bansal M, Mehrotra S (2019) On solving two-stage distributionally robust disjunctive programs with a general ambiguity set. Eur. J. Oper. Res. 279(2):296–307.Crossref, Google Scholar
• Bansal M, Zhang Y (2021) Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs. J. Global Optim. 81(2):391–433.Crossref, Google Scholar
• Bansal M, Huang KL, Mehrotra S (2018a) Decomposition algorithms for two-stage distributionally robust mixed binary programs. SIAM J. Optim. 28(3):2360–2383.Crossref, Google Scholar
• Bansal M, Huang KL, Mehrotra S (2018b) Tight second-stage formulations for two-stage stochastic mixed integer programs. SIAM J. Optim. 28(1):788–819.Crossref, Google Scholar
• Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6):832–848.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
• Gangammanavar H, Bansal M (2022) Stochastic decomposition method for two-stage distributionally robust linear optimization. SIAM J. Optim. 32(3):1901–1930.Crossref, Google Scholar
• Geodis (2017) 2017 supply chain worldwide survey. https://geodis.com/sites/default/files/2019-03/170509_GEODIS_WHITE-PAPER.PDF.Google Scholar
• Guan Y, Ahmed S, Nemhauser GL (2007) Sequential pairing of mixed integer inequalities. Discrete Optim. 4(1):21–39.Crossref, Google Scholar
• Günlük O, Pochet Y (2001) Mixing mixed-integer inequalities. Math. Programming 90(3):429–457.Crossref, Google Scholar
• Hartman JC, Büyüktahtakin IE, Smith JC (2010) Dynamic-programming-based inequalities for the capacitated lot-sizing problem. IIE Trans. 42(12):915–930.Crossref, Google Scholar
• Hong Z, Chu C, Yu Y (2016) Dual-mode production planning for manufacturing with emission constraints. Eur. J. Oper. Res. 251(1):96–106.Crossref, Google Scholar
• Hwang HC, Ahn HS, 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
• Hwang HC, Ahn HS, Kaminsky P (2016) Algorithms for the two-stage production-capacitated lot-sizing problem. J. Global Optim. 65(4):777–799.Crossref, 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
• Kang S, Bansal M (2023) Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set. Networks 81(1):3–22.Crossref, Google Scholar
• Kang S, Bansal M (2025) Distributionally risk-receptive and robust multistage stochastic integer programs and interdiction models. Math. Programming, published online March 20, https://doi.org/10.1007/s10107-024-02192-y.Crossref, Google Scholar
• Kulkarni K, Bansal M (2022) Discrete multi-module capacitated lot-sizing problems with multiple items. Oper. Res. Lett. 50(2):168–175.Crossref, Google Scholar
• Kulkarni K, Bansal M (2023) Exact algorithms for multi-module capacitated lot-sizing problem, and its generalizations with two-echelons and piecewise concave production costs. IISE Trans. 55(12):1187–1202.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(5):735–747.Link, Google Scholar
• Lenstra HW (1983) Integer programming with a fixed number of variables. Math. Oper. Res. 8(4):538–548.Link, Google Scholar
• Love SF (1972) A facilities in series inventory model with nested schedules. Management Sci. 18(5-part-1):327–338.Link, Google Scholar
• Melo RA, Wolsey LA (2010) Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38(4):241–245.Crossref, 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
• Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming (Springer, Berlin).Google Scholar
• Sargut FZ, Romeijn HE (2007) Capacitated production and subcontracting in a serial supply chain. IIE Trans. 39(11):1031–1043.Crossref, Google Scholar
• Sarin SC, Yao L, Trietsch D (2011) Single-batch lot streaming in a two-stage assembly system. Internat. J. Planning Scheduling 1(1):90–108.Crossref, Google Scholar
• van Hoesel CPM, Wagelmans APM (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 APM (2005) Integrated lot sizing in serial supply chains with production capacities. Management Sci. 51(11):1706–1719.Link, Google Scholar
• Van Vyve M (2005) The continuous mixing polyhedron. Math. Oper. Res. 30(2):441–452.Link, Google Scholar
• Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89–96.Link, Google Scholar
• Zangwill WI (1969) A backlogging model and a multi-echelon 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
• Zhao M, Zhang M (2020) Multiechelon lot sizing: New complexities and inequalities. Oper. Res. 68(2):534–551.Abstract, Google Scholar