.png){kind=icon}
.png){kind=icon}
Return
An integrated batch scheduling algorithm for order and rack sequencing with multi-visit mobile robots
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2026.132056.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies order and rack sequencing in robotic mobile fulfillment systems with multiple picking stations, a key driver of warehouse picking efficiency. In these systems, mobile robots bring racks to several picking stations where human workers process customer orders. The decision problem is to assign and sequence orders and racks while handling rack sharing and avoiding conflicts across stations. We formalize this setting as an order and rack sequencing problem with multi-visit mobile robots and model it as a mixed-integer linear program. To solve it efficiently, we design an integrated batch scheduling algorithm and introduce data preprocessing rules that reduce computational complexity. We evaluate the approach on established benchmark instances and on real data from a large e-commerce retailer. The results show that our algorithm substantially outperforms benchmark methods in both solution quality and computation time, especially for multiple picking stations and large-scale instances. We also implement a rack-waiting strategy that further improves rack scheduling across stations.
Keywords:
order and rack sequencing
robotic mobile fulfillment systems
multi-visit mobile robots
batch scheduling
warehouse picking efficiency
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W