Optimal Assignment of Shipments to Milk Runs for Just-in-Time Part Supply Under Uncertain Due Dates

References

• Albareda-Sambola M, Fernández E (2000) The stochastic generalised assignment problem with Bernoulli demands. Top 8(2):165–190.Crossref, Google Scholar
• Albareda-Sambola M, van der Vlerk MH, Fernández E (2006) Exact solutions to a class of stochastic generalized assignment problems. Eur. J. Oper. Res. 173(2):465–487.Crossref, Google Scholar
• Albright C, Derman C (1972) Asymptotic optimal policies for the stochastic sequential assignment problem. Management Sci. 19(1):46–51.Link, Google Scholar
• Baals J (2024) Environmental aspects in supplier networks-a bi-objective just-in-time truck routing problem. Internat. J. Production Res. 62(12):4290–4313.Crossref, Google Scholar
• Baals J, Emde S, Turkensteen M (2023) Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem. Eur. J. Oper. Res. 306(2):707–741.Crossref, Google Scholar
• Baller AC, Dabia S, Dullaert WEH, Vigo D (2020) The vehicle routing problem with partial outsourcing. Transportation Sci. 54(4):1034–1052.Link, Google Scholar
• Bertazzi L, Laganà D, Ohlmann JW, Paradiso R (2020) An exact approach for cyclic inbound inventory routing in a level production system. Eur. J. Oper. Res. 283(3):915–928.Crossref, Google Scholar
• Boysen N, Briskorn D, Emde S (2016) Just-in-time vehicle scheduling with capacity constraints. IIE Trans. 48(2):134–145.Crossref, Google Scholar
• Boysen N, Emde S, Hoeck M, Kauderer M (2015) Part logistics in the automotive industry: Decision problems, literature review and research agenda. Eur. J. Oper. Res. 242(1):107–120.Crossref, Google Scholar
• Büsing C, Leitner M, Wrede S (2025) Cover-based inequalities for the single-source capacitated facility location problem with customer preferences. Comput. Oper. Res. 182:107082. Crossref, Google Scholar
• Ceschia S, Di Gaspero L, Schaerf A (2011) Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Scheduling 14(6):601–615.Crossref, Google Scholar
• Chitsaz M, Cordeau JF, Jans R (2020) A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282(3):896–910.Crossref, Google Scholar
• Chuah KH, Yingling JC (2005) Routing for a just-in-time supply pickup and delivery system. Transportation Sci. 39(3):328–339.Link, Google Scholar
• Crainic TG, Hewitt M, Maggioni F, Rei W (2021) Partial benders decomposition: General methodology and application to stochastic network design. Transportation Sci. 55(2):414–435.Link, Google Scholar
• Derman C, Lieberman GJ, Ross SM (1972) A sequential stochastic assignment problem. Management Sci. 18(7):349–355.Link, Google Scholar
• Dong ZJ, Turnquist MA (2015) Combining service frequency and vehicle routing for managing supplier shipments. Transportation Res. Part E: Logist. Transportation Rev. 79:231–243. Crossref, Google Scholar
• Elçi Ö, Hooker J (2022) Stochastic planning and scheduling with logic-based benders decomposition. INFORMS J. Comput. 34(5):2428–2442.Link, Google Scholar
• Emde S, Gendreau M (2017) Scheduling in-house transport vehicles to feed parts to automotive assembly lines. Eur. J. Oper. Res. 260(1):255–267.Crossref, Google Scholar
• Emde S, Schneider M (2018) Just-in-time vehicle routing for in-house part feeding to assembly lines. Transportation Sci. 52(3):657–672.Link, Google Scholar
• Florio AM, Hartl RF, Minner S, Salazar-González JJ (2021) A branch-and-price algorithm for the vehicle routing problem with stochastic demands and probabilistic duration constraints. Transportation Sci. 55(1):122–138.Link, Google Scholar
• Gahm C, Brabänder C, Tuma A (2017) Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options. Transportation Res. Part E: Logist. Transportation Rev. 97:192–216.Crossref, Google Scholar
• Güner AR, Murat A, Chinnam RB (2017) Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks. Transportation Res. Part E: Logist. Transportation Rev. 97:251–267.Crossref, Google Scholar
• Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Oper. Res. 39(5):836–846.Link, Google Scholar
• Hall NG, Kubiak W, Sethi SP (1991) Earliness–tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Oper. Res. 39(5):847–856.Link, Google Scholar
• Hjorring C, Holt J (1999) New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86(0):569–584.Crossref, Google Scholar
• Hoogendoorn Y, Spliet R (2023) An improved integer L-shaped method for the vehicle routing problem with stochastic demands. INFORMS J. Comput. 35(2):423–439.Link, Google Scholar
• Kaparis K, Letchford AN (2010) Separation algorithms for 0-1 knapsack polytopes. Math. Programming 124(1):69–91.Crossref, Google Scholar
• Karademir S, Kong N, Prokopyev OA (2014) On greedy approximation algorithms for a class of two-stage stochastic assignment problems. Optim. Methods Software 29(1):42–67.Crossref, Google Scholar
• Khatibi A, Jacobson SH (2018) Generalized sequential stochastic assignment problem. Stochastic Systems 8(4):293–306.Link, Google Scholar
• Khatibi A, Baharian G, Behzad B, Jacobson SH (2015) Extensions of the sequential stochastic assignment problem. Math. Methods Oper. Res. 82(3):317–340.Crossref, Google Scholar
• Khatibi A, Baharian G, Kone ER, Jacobson SH (2014) The sequential stochastic assignment problem with random success rates. IIE Trans. 46(11):1169–1180.Crossref, Google Scholar
• Kilic HS, Durmusoglu MB, Baskak M (2012) Classification and modeling for in-plant milk-run distribution systems. Internat. J. Advanced Manufacturing Tech. 62(9):1135–1146.Crossref, Google Scholar
• Kogan K, Shtub A (1997) DGAP—The dynamic generalized assignment problem. Ann. Oper. Res. 69(0):227–239.Crossref, Google Scholar
• Kogan K, Khmelnitsky E, Ibaraki T (2005) Dynamic generalized assignment problems with stochastic demands and multiple agent–task relationships. J. Global Optim. 31(1):17–43.Crossref, Google Scholar
• Lai K, Cheng TCE (2009) Just-in-Time Logistics, 1st ed. (Routledge, London).Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Let. 13(3):133–142.Crossref, Google Scholar
• Lübben M, Pries S, Sikora CGS (2023) Online resequencing of buffers for automotive assembly lines. Comput. Indust. Engrg. 175:108857.Crossref, Google Scholar
• Mao Z, Huang D, Fang K, Wang C, Lu D (2020) Milk-run routing problem with progress-lane in the collection of automobile parts. Ann. Oper. Res. 291:657–684.Crossref, Google Scholar
• Mazzola JB, Neebe AW (2012) A generalized assignment model for dynamic supply chain capacity planning. Naval Res. Logist. 59(6):470–485.Crossref, Google Scholar
• Meyer A, Amberg B (2018) Transport concept selection considering supplier milk runs—An integrated model and a case study from the automotive industry. Transportation Res. Part E: Logist. Transportation Rev. 113:147–169.Crossref, Google Scholar
• Natarajarathinam M, Stacey J, Sox C (2012) Near‐optimal heuristics and managerial insights for the storage constrained, inbound inventory routing problem. Internat. J. Physical Distribution Logist. Management 42(2):152–173.Crossref, Google Scholar
• Novaes AGN, Lima OF, Luna MMM, Bez ET (2017) Mitigating supply chain tardiness risks in OEM milk-run operations. Freitag M, Kotzab H, Pannek J, eds. Dynamics in Logistics (Springer International Publishing, Cham, Switzerland), 141–150.Crossref, Google Scholar
• Ohlmann JW, Fry MJ, Thomas BW (2008) Route design for lean production systems. Transportation Sci. 42(3):352–370.Link, Google Scholar
• Ojha R, Chen W, Zhang H, Khir R, Erera A, Van Hentenryck P (2025) Outbound load planning in parcel delivery service networks using machine learning and optimization. Transportation Sci. 59(5):1057–1075.Link, Google Scholar
• Öncan T (2007) A survey of the generalized assignment problem and its applications. INFOR: Inform. Systems Oper. Res. 45(3):123–141.Crossref, Google Scholar
• Pentico DW (2007) Assignment problems: A golden anniversary survey. Eur. J. Oper. Res. 176(2):774–793.Crossref, Google Scholar
• Pfenning Logistics (2025) Automotive logistics: Your partner in the automotive industry—Pfenning-logistics.com. Accessed November 3, https://tinyurl.com/2er562je.Google Scholar
• Powell WB (1996) A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. 30(3):195–219.Link, Google Scholar
• Radhakrishnan S, Harris B, Kamarthi S (2018) Supply chain resiliency: A review. Khojasteh Y, ed. Supply Chain Risk Management (Springer, Singapore), 215–235.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Ranjbaran F, Kashan AH, Kazemi A (2020) Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets. Internat. J. Production Res. 58(6):1741–1775.Crossref, Google Scholar
• Sarin SC, Sherali HD, Kim SK (2014) A branch-and-price approach for the stochastic generalized assignment problem. Naval Res. Logist. 61(2):131–143.Crossref, Google Scholar
• Spivey MZ, Powell WB (2004) The dynamic assignment problem. Transportation Sci. 38(4):399–419.Link, Google Scholar
• Spliet R, Desaulniers G (2015) The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244(2):379–391.Crossref, Google Scholar
• Spliet R, Gabor AF (2015) The time window assignment vehicle routing problem. Transportation Sci. 49(4):721–731.Link, Google Scholar
• Toktas B, Yen JW, Zabinsky ZB (2006) Addressing capacity uncertainty in resource-constrained assignment problems. Comput. Oper. Res. 33(3):724–745.Crossref, Google Scholar
• Van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.Crossref, Google Scholar
• Verband der Automobilindustrie (2020) Smart data in automotive production. Accessed November 24, 2025, https://tinyurl.com/bdpsksm4.Google Scholar
• Zhang Z, Guo C, Ruan W, Wang W, Zhou P (2022) An intelligent stochastic optimization approach for stochastic order allocation problems with high-dimensional order uncertainties. Comput. Indust. Engrg. 167:108008.Crossref, Google Scholar