A Real-Time Control Policy to Achieve Maximum Throughput of an Online Order Fulfillment Network

Published Online:https://doi.org/10.1287/trsc.2023.0096

References

  • Abouelrous A, Gabor AF, Zhang Y (2022) Joint inventory and fulfilment optimization for an omnichannel retailer: A stochastic optimization approach. Comput. Indust. Engrg. 173:108723.CrossrefGoogle Scholar
  • Acimovic J, Farias VF (2019) The Fulfillment-Optimization Problem. Operations Research & Management Science in the Age of Analytics (INFORMS, Catonsville, MD), 218–237.LinkGoogle Scholar
  • Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manufacturing Service Oper. Management 17(1):34–51.LinkGoogle Scholar
  • Agatz NA, Fleischmann M, Van Nunen JA (2008) E-fulfillment and multi-channel distribution—A review. Eur. J. Oper. Res. 187(2):339–356.CrossrefGoogle Scholar
  • Agatz N, Campbell A, Fleischmann M, Savelsbergh M (2011) Time slot management in attended home delivery. Transportation Sci. 45(3):435–449.LinkGoogle Scholar
  • Alibeiki H, Hassanlou M, Jorjani S (2020) Fulfillment optimization for online retailers under stochastic demands. J. Supply Chain Oper. Management 18(2):194.Google Scholar
  • Andrews JM, Farias VF, Khojandi AI, Yan CM (2019) Primal–dual algorithms for order fulfillment at Urban Outfitters, Inc. INFORMS J. Applied Anal. 49(5):355–370.LinkGoogle Scholar
  • Barman S, Levin MW (2022) Performance evaluation of modified cyclic max-pressure controlled intersections in realistic corridors. Transportation Res. Rec. 2676(6):110–128.Google Scholar
  • Bayram A, Cesaret B (2021) Order fulfillment policies for ship-from-store implementation in omni-channel retailing. Eur. J. Oper. Res. 294(3):987–1002.CrossrefGoogle Scholar
  • Chekuri C, Khanna S (2005) A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3):713–728.CrossrefGoogle Scholar
  • Ganti A, Modiano E, Tsitsiklis JN (2007) Optimal transmission scheduling in symmetric communication models with intermittent connectivity. IEEE Trans. Inform. Theory 53(3):998–1008.CrossrefGoogle Scholar
  • Govindarajan A, Sinha A, Uichanco J (2021) Joint inventory and fulfillment decisions for omnichannel retail networks. Naval Res. Logist. 68(6):779–794.CrossrefGoogle Scholar
  • Jasin S, Sinha A (2015) An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. Oper. Res. 63(6):1336–1351.LinkGoogle Scholar
  • Jiu S (2022) Robust omnichannel retail operations with the implementation of ship-from-store. Transportation Res., Part E Logist. Trans. Rev. 157:102550.CrossrefGoogle Scholar
  • Kang D, Levin MW (2021) Maximum-stability dispatch policy for shared autonomous vehicles. Transportation Res. Part B: Methodological 148:132–151.CrossrefGoogle Scholar
  • Lei Y, Jasin S, Sinha A (2018) Joint dynamic pricing and order fulfillment for e-commerce retailers. Manufacturing Service Oper. Management 20(2):269–284.LinkGoogle Scholar
  • Li L, Pantelidis T, Chow JY, Jabari SE (2021) A real-time dispatching strategy for shared automated electric vehicles with performance guarantees. Transportation Res., Part E Logist. Trans. Rev. 152:102392.CrossrefGoogle Scholar
  • Lim YF, Jiu S, Ang M (2021) Integrating anticipative replenishment allocation with reactive fulfillment for online retailing using robust optimization. Manufacturing Service Oper. Management 23(6):1616–1633.LinkGoogle Scholar
  • Lin YH, Wang Y, Lee LH, Chew EP (2022) Omnichannel facility location and fulfillment optimization. Transportation Res. Part B: Methodological 163:187–209.CrossrefGoogle Scholar
  • Neely M (2022) Stochastic Network Optimization with Application to Communication and Queueing Systems (Springer Nature, Cham, Switzerland).Google Scholar
  • Sarimveis H, Patrinos P, Tarantilis CD, Kiranoudis CT (2008) Dynamic modeling and control of supply chain systems: A review. Comput. Oper. Res. 35(11):3530–3561.CrossrefGoogle Scholar
  • Sluijk N, Florio AM, Kinable J, Dellaert N, Van Woensel T (2023) Two-echelon vehicle routing problems: A literature review. Eur. J. Oper. Res. 304(3):865–886.CrossrefGoogle Scholar
  • Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.CrossrefGoogle Scholar
  • Sun X, Yin Y (2018) A simulation study on max pressure control of signalized intersections. Transportation Res. Rec. 2672(18):117–127.CrossrefGoogle Scholar
  • Tassiulas L, Ephremides A (1990) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. 29th IEEE Conf. Decision Control (IEEE, Piscataway, NJ), 2130–2132.Google Scholar
  • Taylor D, Brockhaus S, Knemeyer AM, Murphy P (2019) Omnichannel fulfillment strategies: Defining the concept and building an agenda for future inquiry. Internat. J. Logist. Management 30(3):863–891.CrossrefGoogle Scholar
  • Varaiya P (2013) Max pressure control of a network of signalized intersections. Transportation Res., Part C Emerg. Technol. 36:177–195.CrossrefGoogle Scholar
  • Walton NS (2014) Concave switching in single and multihop networks. Perform. Eval. Rev. 42(1):139–151.CrossrefGoogle Scholar
  • Wongpiromsarn T, Uthaicharoenpong T, Wang Y, Frazzoli E, Wang D (2012) Distributed traffic signal control for maximum network throughput. 2012 15th Internat. IEEE Conf. Intelligent Transportation Systems (IEEE, Piscataway, NJ), 588–595.Google Scholar
  • Xu PJ, Allgor R, Graves SC (2009) Benefits of reevaluating real-time order fulfillment decisions. Manufacturing Service Oper. Management 11(2):340–355.LinkGoogle Scholar
  • Xu Z, Zhang H, Zhang J, Zhang RQ (2020) Online demand fulfillment under limited flexibility. Management Sci. 66(10):4667–4685.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.