3127. A dynamic programming algorithm for order picking in robotic mobile fulfillment systems
Invited abstract in session TB-17: Novel applications in warehousing, maritime transport, and healthcare, stream Combinatorial Optimization.
Tuesday, 10:30-12:00Room: Esther Simpson 2.08
Authors (first author is the speaker)
| 1. | Erwin Pesch
|
| Faculty III, University of Siegen | |
| 2. | Jan-Erik Justkowiak
|
| Management Information Science, University of Siegen | |
| 3. | Mikhail Y. Kovalyov
|
| United Institute of Informatics Problems, National Academy of Sciences of Belarus |
Abstract
The order scheduling and rack sequencing problem deals with the order picking process in robotic mobile fulfillment systems: automated guided vehicles lift and transport movable storage racks to picking stations to supply items requested by customer orders which are put together in cardboard boxes on a workbench of limited capacity. To efficiently operate the station, the sequence in which racks visit the station one after another and the intervals at which customer orders are scheduled must be coordinated. We present a dynamic programming algorithm for the order scheduling and rack sequencing problem at a single picking station minimizing the number of rack visits. Despite monolithic mixed integer linear programming formulations, our approach appears to be the first combinatorial solution method for the problem. A computational study demonstrates the effectiveness of the approach.
Keywords
- Programming, Dynamic
- Scheduling
Status: accepted
Back to the list of papers