Event-Driven Integration of Rush Orders into Warehouse Order Picking

Warehouses must respond promptly to rush orders while continuing to process regular orders and limiting disruption to existing picking routes. This study develops a mixed-integer linear programming model for integrating a rush order into an ongoing picking plan. The model considers picker assignments, order sequences, rush-order response time, regular-order tardiness, travel distance, and reassignment of regular orders. Three strategies are compared: assigning the rush order to the earliest available picker, inserting it at the best feasible position in an existing route, and rescheduling orders that have not yet been picked. The strategies are evaluated in 270 scenarios generated from 45 initial conditions with varying order counts and deadlines. Insertion and rescheduling met the rush-order deadline in every scenario. Compared with insertion, rescheduling reduced average travel distance by approximately 8.5% (from 457.38 m to 418.65 m) and the average weighted objective value by approximately 29.0% (from 0.1229 to 0.0873). These findings suggest that coordinated changes to picker assignments and order sequences can improve overall picking performance. The appropriate extent of rescheduling depends on the relative importance assigned to the performance measures in the objective function.

Authors

Institutions

Publication Details

Journal
Systems
Published
2026-11-18
DOI
https://doi.org/10.3390/systems14111485
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Event-Driven Integration of Rush Orders into Warehouse Order Picking

Ágota Bányainé Tóth
1 links
Systems
Advanced Manufacturing and Logistics Optimization
article

Event-Driven Integration of Rush Orders into Warehouse Order Picking

Ágota Bányainé Tóth
article en

Abstract

Warehouses must respond promptly to rush orders while continuing to process regular orders and limiting disruption to existing picking routes. This study develops a mixed-integer linear programming model for integrating a rush order into an ongoing picking plan. The model considers picker assignments, order sequences, rush-order response time, regular-order tardiness, travel distance, and reassignment of regular orders. Three strategies are compared: assigning the rush order to the earliest available picker, inserting it at the best feasible position in an existing route, and rescheduling orders that have not yet been picked. The strategies are evaluated in 270 scenarios generated from 45 initial conditions with varying order counts and deadlines. Insertion and rescheduling met the rush-order deadline in every scenario. Compared with insertion, rescheduling reduced average travel distance by approximately 8.5% (from 457.38 m to 418.65 m) and the average weighted objective value by approximately 29.0% (from 0.1229 to 0.0873). These findings suggest that coordinated changes to picker assignments and order sequences can improve overall picking performance. The appropriate extent of rescheduling depends on the relative importance assigned to the performance measures in the objective function.

SystemsVol. 14(11)
University of Miskolc (HU)
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon