Volltext-Downloads (blau) und Frontdoor-Views (grau)

Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems

  • This paper addresses the order- and rack-sequencing problem at a single picking station in the context of robotic mobile fulfillment systems, a warehouse technology typically applied in large distribution centers. Following the parts-to-picker concept, items are stored on movable racks that are lifted and transported by automated guided vehicles from the storage area to picking stations for order-processing. The order-picking process involves two linked decisions: How to sequence the processing of orders and how to sequence the rack visits to supply the picking station with the requested items. We present a novel mixed-integer linear programming formulation achieving stronger linear programming bounds than a previous formulation. Including preprocessing techniques it quickly solves instances of medium-size to proven optimality for the first time in literature. For large real-world instances, we provide a three-stage heuristic solution procedure suitable in a dynamic environment, while providing competitive solutions within a short run time. Computational experiments on a broad set of benchmark instances and a comparative study with approaches from literature verify our results.

Export metadata

Additional Services

Search Google Scholar


Document Type:Article
Author:Jan-Erik JustkowiakORCiD, Erwin Pesch
Center:Center for Advanced Studies in Management (CASiM)
Parent Title (English):European journal of operational research : EJOR
Issue:3 (16 March 2023)
Date of Publication (online):2022/06/30
First Page:1063
Last Page:1078
Tag:Mixed-integer linear programming; Order-sequencing; Robotic mobile fulfillment system; Scheduling; Storage assignment; Strategy; Warehouse logistic
Content Focus:Academic Audience
Peer Reviewed:Yes
Rankings:AJG Ranking / 4
VHB Ranking / A
SJR Ranking / Q1
Licence (German):License LogoUrheberrechtlich gesch├╝tzt