Order batching and picker scheduling in warehouse order picking

References

• Ardjmand, E., Shakeri, H., Singh, M. and Bajgiran, O.S. (2018) Minimizing order picking makespan with multiple pickers in a wave picking warehouse. International Journal of Production Economics, 206, 169–283.
   Web of Science ®Google Scholar
• Baldacci, R., Mingozzi. A. and Roberti, R. (2011) New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 5(5), 1269–1283.
   Google Scholar
• Chabot, T., Lahyani, R., Coelho, L.C. and Renaud, J. (2017) Order picking problems under weight, fragility and category constraints. International Journal of Production Research, 55(21), 6361–6379.
   Web of Science ®Google Scholar
• Chen, T-L., Cheng, C-Y., Chen, Y-Y. and Chan, L-K. (2015) An efficient hybrid algorithm for integrated order batching, sequencing and routing problem. International Journal of Production Economics, 159, 158–167.
   Web of Science ®Google Scholar
• Dantzig, G.B. and Wolfe, P. (1960) Decomposition principle for linear programs. Operations Research, 8(1), 101–111.
   Web of Science ®Google Scholar
• de Koster, R., Le-Duc, T. and Roodbergen, K.J. (2007) Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182, 481–501.
   Web of Science ®Google Scholar
• de Koster R., Roodbergen, K. and van Voorden, R. (1999) Reduction of walking time in the distribution center of De Bijenkorf, in New Trends in Distribution Logistics, Springer, Berlin, pp. 215–234.
   Google Scholar
• Ehrgott, M. (2005) Multicriteria Optimization. Springer-Verlag, Berlin, Heidelberg.
   Google Scholar
• Faber, N., de Koster, R.B.M. and Smidts, A. (2018) Survival of the fittest: The impact of fit between warehouse management structure and warehouse context on warehouse performance. International Journal of Production Research, 56(1-2), 120–139.
   Web of Science ®Google Scholar
• Frazelle, E. (2001) Supply Chain Strategy, McGraw-Hill, New York, NY.
   Google Scholar
• Gademann, N. and van de Velde, S. (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Transactions, 37(1), 63–75.
   Web of Science ®Google Scholar
• Gademann, N., van Den Berg, J.P. and van Der Hoff, H.H. (2001) An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Transactions, 33, 385–398.
   Web of Science ®Google Scholar
• Graham, R., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1977) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 51, 187–326.
   Google Scholar
• Hansen, P. and Mladenović, N. (2001) Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449–467.
   Web of Science ®Google Scholar
• Hansen, P., Mladenović, N., Brimberg, J. and Moreno Pérez, J.A. (2019) Variable neighborhood search, in Handbook of Metaheuristics, Springer, New York, NY, pp. 57–97.
   Google Scholar
• Henn, S. (2012) Algorithms for on-line order batching in an order picking warehouse. Computers and Operations Research, 39, 2549–2563.
   Web of Science ®Google Scholar
• Henn, S. (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flexible Services and Manufacturing Journal, 27, 86–114.
   Web of Science ®Google Scholar
• Henn, S. and Schmid, V. (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Computers and Industrial Engineering, 66(2), 338–351.
   Web of Science ®Google Scholar
• Henn, S. and Wäsher, G. (2012) Tabu search heuristics for the order batching problem in manual order picking systems. European Journal of Operational Research, 222, 484–494.
   Web of Science ®Google Scholar
• Huber, S. and Geiger, M.J. (2017) Order matters - a variable neighborhood search for the swap-body vehicle routing problem. European Journal of Operational Research, 263, 419–445.
   Web of Science ®Google Scholar
• Hwang, H. and Kim, D.G. (2005) Order-batching heuristics based on cluster analysis in low-level picker-to-part warehousing system. International Journal of Production Research, 43(17), 3657–3670.
   Web of Science ®Google Scholar
• Lübbecke, M.E. and Desrosiers, J. (2005) Selected topics in column generation. Operations Research, 53(6), 1007–1023.
   Web of Science ®Google Scholar
• Martello, S. and Toth, P. (1990) Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, New York, NY.
   Google Scholar
• Matusiak, M., de Koster, R. and Saarinen, J. (2017) Utilizing individual picker skills to improve order batching in a warehouse. European Journal of Operational Research, 263, 888–899.
   Web of Science ®Google Scholar
• Mingozzi, A., Roberti, R. and Toth, P. (2013) An exact algorithm for the multi-trip vehicle routing problem. INFORMS Journal on Computing, 25, 193–207.
   Web of Science ®Google Scholar
• Muter, İ. (2020) Optimization of single and parallel batch processing machines. European Journal of Operational Research, 285(2), 470–483.
   Web of Science ®Google Scholar
• Muter, İ., Cordeau, J-F. and Laporte, G. (2014) A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes. Transportation Science, 48(3), 425–441.
   Web of Science ®Google Scholar
• Muter, İ. and Öncan, T. (2015) An exact solution approach for the order batching problem. IIE Transactions, 47(7), 728–738.
   Web of Science ®Google Scholar
• Nemhauser, G.L. and Wolsey, L.A. (1988) Integer and Combinatorial Optimization, John Wiley & Sons, New York, NY.
   Google Scholar
• Öncan, T. (2015) MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. European Journal of Operational Research, 243(1), 142–155.
   Web of Science ®Google Scholar
• Öncan, T., Kabadi, N.S., Nair, K.P.K. and Punnen, A.P. (2008) VLSN search algorithms for partitioning problems using matching neighbourhoods. Journal of the Operational Research Society, 59(3), 388–398.
   Web of Science ®Google Scholar
• Pei, J., Dražić, Z., Dražić, M., Mladenović, N. and Pardalos, P.M. (2019) Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations. INFORMS Journal on Computing, 31(2), 235–250.
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Fan, W., Pardalos, P.M. and Lu, S. (2019) A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega, 82, 55–69.
   Web of Science ®Google Scholar
• Petersen, C.G. (1997) An evaluation of order picking routeing policies. International Journal of Operations and Production Management, 17(11), 1098–1111.
   Web of Science ®Google Scholar
• Petersen, C.G. and Schmenner, R.W. (1999) An evaluation of routing and volume-based storage policies in an order picking operation. Decision Sciences, 30(2), 481–501.
   Web of Science ®Google Scholar
• Pinto, A.R.F., Crepaldi, A.F. and Nagano, M.S. (2018) A genetic algorithm applied to pick sequencing for billing. Journal of Intelligent Manufacturing, 29, 405–422.
   Web of Science ®Google Scholar
• Pinto, A.R.F. and Nagano, M.S. (2020) Genetic algorithms applied to integration and optimization of billing and picking processes. Journal of Intelligent Manufacturing, 31, 641–659.
   Web of Science ®Google Scholar
• Scholz, A., Schubert, D. and Wäsher, G. (2017) Order picking with multiple pickers and due dates - simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. European Journal of Operational Research, 263, 461–478.
   Web of Science ®Google Scholar
• Tompkins, J.A., White, J.A., Bozer, Y.A. and Tanchoco, J.M.A. (2010) Facilities Planning, John Wiley & Sons, Hoboken, NJ.
   Google Scholar