The min–max order picking problem in synchronised dynamic zone-picking systems

Serhat Saylam, Melih Çelik, Haldun Sural

Research output: Contribution to journalArticlepeer-review

7 Citations (SciVal)

Abstract

In both manual and automated warehouses, a combination of efficient zoning and picker routing plays an important role in improving travel time, congestion, and system throughput. This paper considers the order picker routing problem in a dynamic and synchronised zoning environment, where the items corresponding to each customer order are picked simultaneously in multiple zones, and zones may change between different orders. The objective is to minimise the maximum time of completing the picking activities in any zone. Using a min–max type of objective not only minimises the makespan of an order picking wave, but it also helps balance the workload of the order pickers more effectively. We present a mathematical model for the optimal solution of this problem, as well as a dynamic programming approach to find the optimal solution for the case where a zone is a set of adjacent aisles. Computational experiments on randomly generated instances show that the dynamic programming approach is able to find optimal solutions in negligible computational times.

Original languageEnglish
Pages (from-to)2086-2104
JournalInternational Journal of Production Research
Volume61
Issue number7
Early online date10 Apr 2022
DOIs
Publication statusPublished - 31 Dec 2023

Keywords

  • Warehouse management
  • dynamic programming
  • heuristics
  • order picking
  • workload balancing
  • zone picking

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'The min–max order picking problem in synchronised dynamic zone-picking systems'. Together they form a unique fingerprint.

Cite this