Anticipatory Packing

Problem definition: Order fulfillment plays a pivotal role in shaping the competitiveness and profitability of online retailers. However, the erratic nature of order arrivals at fulfillment centers leads to imbalanced workloads and soaring operational costs. To tackle this challenge, we investigate the practice of anticipatory packing as a potential solution. Anticipatory packing involves strategically preparing packages during nonpeak periods to fulfill orders during subsequent peak periods. In the face of order arrival uncertainties, our objective is to optimize the selection of packages to be packed during these nonpeak periods. Methodology/results: We develop a two-stage sample average approximation model using recent order data to enable effective anticipatory packing. For the second stage problem, which optimizes the usage of prepacked packages, we design a constant factor approximation algorithm. The first stage problem is shown to be NP-hard to approximate within a factor of [Formula: see text] asymptotically, where T is the sample size and [Formula: see text] is a measure for the inherent order structures. To address this, we propose general approximation algorithms with an approximation ratio of [Formula: see text], where K is the maximum size of prepackages. For orders with laminar structures, the approximation ratio improves to [Formula: see text]. To enhance practical performance, we introduce a refined integer programming reformulation and an efficient subgradient descent method for solving the associated Lagrangian dual. Experimental results with real-world data demonstrate that anticipatory packing can reduce operational costs by more than 7%, significantly lowering fixed investment expenses. Managerial implications: We showcase the significant potential of anticipatory packing as an analytics-driven operational strategy. Its widespread adoption could lead to substantial reductions in both operating expenses and fixed investment costs. Funding: Y. Li acknowledges support from The City University of Hong Kong [Grant APR: 9676039] and the Key Program of the National Natural Science Foundation of China [Grant 72531011]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0866 .

• 저널Manufacturing & Service Operations Management
• 토픽Optimization and Packing Problems · Industrial and Manufacturing Engineering
• DOI10.1287/msom.2024.0866
• 저자Tongwen Wu, Zuo‐Jun Max Shen, Yanzhi Li