×

Managing cutoff-based shipment promises for order fulfilment processes in warehousing. (English) Zbl 07889394

Summary: Warehouses recently face increasing stress imposed by a volatile customer demand and increasing customer expectations in terms of ever shorter order response times. In that respect, warehouses more and more offer same-day and next-day shipment conditions. However, same-day shipment promises are challenging to fulfil, especially as the order fulfilment process operates against fixed deadlines imposed by the predefined truck departure times. As a natural mitigation strategy, warehouses set a cutoff point and offer same-day shipment only to customers that order until the cutoff point, but next-day shipment to all customers ordering thereafter. Setting an appropriate cutoff point is challenging as it affects multiple facets of the service quality, such as the order response time and the service level. In this paper, we study the design of cutoff-based shipment promises for stochastic deadline-oriented order fulfilment processes in warehouses. We present a discrete-time Markov chain model for exact steady-state performance analysis and propose two novel performance measures – \( \alpha\)- and \(\beta\)- cutoff service level – for service level measurement in these systems. We numerically show the benefit of cutoff-based shipment promises. Even with a late cutoff point, there is a significant gain in the system performance. Furthermore, we find that warehouses should set the cutoff point such that it balances customer expectations in terms of service level and order response time. Finally, warehouses can improve their shipment promises when referring to \(\beta\)- instead of \(\alpha\)- cutoff service level and by implementing measures reducing the utilisation and the variabilities of the order fulfilment process.

MSC:

90B05 Inventory, storage, reservoirs
60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

References:

[1] Boysen, N.; de Koster, R.; Füßler, D., The forgotten sons: warehousing systems for brick-and-mortar retail chains, Eur J Oper Res, 288, 2, 361-381, 2021 · Zbl 1487.90080 · doi:10.1016/j.ejor.2020.04.058
[2] Boysen, N.; de Koster, R.; Weidinger, F., Warehousing in the e-commerce era: a survey, Eur J Oper Res, 277, 2, 396-411, 2019 · Zbl 1430.90065 · doi:10.1016/j.ejor.2018.08.023
[3] Boysen, N.; Schwerdfeger, S.; Stephan, K., A review of synchronization problems in parts-to-picker warehouses, Eur J Oper Res, 307, 3, 1374-1390, 2023 · Zbl 07709085 · doi:10.1016/j.ejor.2022.09.035
[4] Ceven, E.; Gue, K., Optimal wave release times for order fulfilment systems with deadlines, Transp Sci, 51, 1, 52-66, 2017 · doi:10.1287/trsc.2015.0642
[5] Chen, TL; Cheng, CY; Chen, YY; Chan, LK, An efficient hybrid algorithm for integrated order batching, sequencing and routing problem, Int J Prod Econ, 159, 158-167, 2015 · doi:10.1016/j.ijpe.2014.09.029
[6] Chew, EP; Tang, LC, Travel time analysis for general item location assignment in a rectangular warehouse, Eur J Oper Res, 112, 3, 582-597, 1999 · Zbl 0933.90042 · doi:10.1016/S0377-2217(97)00416-5
[7] de Koster, R.; Le-Duc, T.; Roodbergen, KJ, Design and control of warehouse order picking: a literature review, Eur J Oper Res, 182, 2, 481-501, 2007 · Zbl 1121.90385 · doi:10.1016/j.ejor.2006.07.009
[8] Doerr, K.; Gue, K., A performance metric and goal-setting procedure for deadline-oriented processes, Prod Oper Manag, 22, 3, 726-738, 2013 · doi:10.1111/j.1937-5956.2012.01375.x
[9] Henn, S.; Schmid, V., Metaheuristics for order batching and sequencing in manual order picking systems, Comput Ind Eng, 66, 2, 338-351, 2013 · doi:10.1016/j.cie.2013.07.003
[10] Kim, TY, Improving warehouse responsiveness by job priority management: A european distribution centre field study, Comput Ind Eng, 139, 2020 · doi:10.1016/j.cie.2018.12.011
[11] Klapp, M.; Erera, A.; Toriello, A., The dynamic dispatch waves problem for same-day delivery, Eur J Oper Res, 271, 2, 519-534, 2018 · Zbl 1403.90135 · doi:10.1016/j.ejor.2018.05.032
[12] Law, AM, Simulation modelling and analysis, 2015, New York: McGraw-Hill Education, New York
[13] Le-Duc, T.; de Koster, RM, Travel time estimation and order batching in a 2-block warehouse, Eur J Oper Res, 176, 1, 374-388, 2007 · Zbl 1137.90332 · doi:10.1016/j.ejor.2005.03.052
[14] MacCarthy, B.; Zhang, L.; Muyldermans, L., Best performance frontiers for buy-online-pickup-in-store order fulfilment, Int J Prod Econ, 211, 251-264, 2019 · doi:10.1016/j.ijpe.2019.01.037
[15] Menéndez, B.; Bustillo, M.; Pardo, EG; Duarte, A., General variable neighbourhood search for the order batching and sequencing problem, Eur J Oper Res, 263, 1, 82-93, 2017 · Zbl 1380.90053 · doi:10.1016/j.ejor.2017.05.001
[16] Mohring, U.; Baumann, M.; Furmans, K., Discrete-time analysis of levelled order release and staffing in order picking systems, Logist Res, 2020 · doi:10.23773/2020_9
[17] Schleyer, M.; Gue, K., Throughput time distribution analysis for a one-block warehouse, Transport Res Part E Logist Transport Rev, 48, 3, 652-666, 2012 · doi:10.1016/j.tre.2011.10.010
[18] Scholz, A.; Schubert, D.; Wäscher, G., Order picking with multiple pickers and due dates-simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems, Eur J Oper Res, 263, 2, 461-478, 2017 · Zbl 1380.90061 · doi:10.1016/j.ejor.2017.04.038
[19] Tempelmeier, H., Inventory management in supply networks: problems, models, solutions, 2011, Norderstedt: Books on Demand, Norderstedt
[20] Ulmer, M., Dynamic pricing and routing for same-day delivery, Transport Sci, 54, 4, 1016-1033, 2020 · doi:10.1287/TRSC.2019.0958
[21] van Gils, T.; Ramaekers, K.; Caris, A.; Cools, M., The use of time series forecasting in zone order picking systems to predict order pickers’ workload, Int J Prod Res, 55, 21, 6380-6393, 2017 · doi:10.1080/00207543.2016.1216659
[22] van Gils, T.; Ramaekers, K.; Caris, A.; de Koster, RB, Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review, Eur J Oper Res, 267, 1, 1-15, 2018 · Zbl 1403.90196 · doi:10.1016/j.ejor.2017.09.002
[23] van Nieuwenhuyse, I.; de Koster, RB, Evaluating order throughput time in 2-block warehouses with time window batching, Int J Prod Econ, 121, 2, 654-664, 2009 · doi:10.1016/j.ijpe.2009.01.013
[24] Vanheusden, S.; van Gils, T.; Braekers, K.; Ramaekers, K.; Caris, A., Analysing the effectiveness of workload balancing measures in order picking operations, Int J Prod Res, 60, 7, 2126-2150, 2021 · doi:10.1080/00207543.2021.1884307
[25] Vanheusden, S.; van Gils, T.; Caris, A.; Ramaekers, K.; Braekers, K., Operational workload balancing in manual order picking, Comput Ind Eng, 141, 2020 · doi:10.1016/j.cie.2020.106269
[26] Voccia, S.; Campbell, A.; Thomas, B., The same-day delivery problem for online purchases, Transport Sci, 53, 1, 167-184, 2019 · doi:10.1287/trsc.2016.0732
[27] Xu, X.; Liu, T.; Li, K.; Dong, W., Evaluating order throughput time with variable time window batching, Int J Prod Res, 52, 8, 2232-2242, 2014 · doi:10.1080/00207543.2013.849009
[28] Yaman, H.; Karasan, OE; Kara, BY, Release time scheduling and hub location for next-day delivery, Oper Res, 60, 4, 906-917, 2012 · Zbl 1260.90101 · doi:10.1287/opre.1120.1065
[29] Zhang, J.; Wang, X.; Huang, K., Integrated on-line scheduling of order batching and delivery under B2C e-commerce, Comput Ind Eng, 94, 280-289, 2016 · doi:10.1016/j.cie.2016.02.001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.