Order and rack sequencing with a rack buffer area and order due dates in robotic mobile fulfillment systems
- 1School of Management Science and Engineering, Southwestern University of Finance and Economics, Chengdu, Sichuan, China
- 2School of Finance, Southwestern University of Finance and Economics, Chengdu, Sichuan, China
Abstract
With the increasing requirements for fulfillment timeliness in e-commerce and the wide application of robotic mobile fulfillment systems, the order picking process needs to balance rack reuse efficiency and on-time order completion. This paper studies an order and rack sequencing problem with a rack buffer area under order due dates. Given limited rack buffer capacity, known order requirements, and order due dates, we jointly optimize the order entry sequence, rack service sequence, and buffer retention decisions. To minimize rack movements and total weighted order tardiness, we formulate a mixed-integer programming model and develop a deadline-aware interactive heuristic with neighborhood search (DA-IHNS). The performance of the proposed model and algorithm is evaluated through randomly generated instances and comparative experiments. In the exact-solution validation, DA-IHNS matches the CPLEX objective on all instances with N = 4 and 6, while the mean relative difference is 3.33% for N = 8. For the main test instances with N = 30, 50, and 80, DA-IHNS achieves mean paired objective reductions of 83.65%–93.98% relative to IH and 79.86%–90.26% relative to EDD-IH, the two rule-based benchmarks. Across the tested synthetic settings, the mean advantage of DA-IHNS over the two rule-based benchmarks remains positive under all examined due-date tightness levels, while buffer capacity and the tardiness penalty coefficient affect the balance between rack reuse and order timeliness. This paper provides a reference for rack buffer configuration, order and rack sequencing, and tardiness control in e-commerce warehousing.
Related
- Conformal Predictive Distributions for Contextual Order Fulfillment Optimization
- Dimensional Decomposition and Column Generation for Bin Dimensioning in E-Commerce Fulfillment Centers
- Fully Coupled Nonlinear Mean-Field FBSΔEs: Solvability and an LQ Buffer-Adjustment Illustration
- Psychological flexibility and self-compassion buffer the impact of shame on depression among adults with physical disabilities
- Mass-gap functional determinant approach for mobile Fermi polarons
BibTeX
@article{yang2026order,
title = {{Order and rack sequencing with a rack buffer area and order due dates in robotic mobile fulfillment systems}},
author = {Yi Yang and Ruoxuan Huang and Dongping Liu and Qinghong Shuai},
journal = {PLOS One},
year = {2026},
month = oct,
doi = {10.1371/journal.pone.0359529},
url = {https://doi.org/10.1371/journal.pone.0359529},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Order and rack sequencing with a rack buffer area and order due dates in robotic mobile fulfillment systems
AU - Yi Yang
AU - Ruoxuan Huang
AU - Dongping Liu
AU - Qinghong Shuai
PY - 2026
DA - 2026/10/06
JO - PLOS One
DO - 10.1371/journal.pone.0359529
UR - https://doi.org/10.1371/journal.pone.0359529
AB - With the increasing requirements for fulfillment timeliness in e-commerce and the wide application of robotic mobile fulfillment systems, the order picking process needs to balance rack reuse efficiency and on-time order completion. This paper studies an order and rack sequencing problem with a rack buffer area under order due dates. Given limited rack buffer capacity, known order requirements, and order due dates, we jointly optimize the order entry sequence, rack service sequence, and buffer retention decisions. To minimize rack movements and total weighted order tardiness, we formulate a mixed-integer programming model and develop a deadline-aware interactive heuristic with neighborhood search (DA-IHNS). The performance of the proposed model and algorithm is evaluated through randomly generated instances and comparative experiments. In the exact-solution validation, DA-IHNS matches the CPLEX objective on all instances with N = 4 and 6, while the mean relative difference is 3.33% for N = 8. For the main test instances with N = 30, 50, and 80, DA-IHNS achieves mean paired objective reductions of 83.65%–93.98% relative to IH and 79.86%–90.26% relative to EDD-IH, the two rule-based benchmarks. Across the tested synthetic settings, the mean advantage of DA-IHNS over the two rule-based benchmarks remains positive under all examined due-date tightness levels, while buffer capacity and the tardiness penalty coefficient affect the balance between rack reuse and order timeliness. This paper provides a reference for rack buffer configuration, order and rack sequencing, and tardiness control in e-commerce warehousing.
SN - 1932-6203
ER -