Solving the online on-demand warehousing problem

DOI10.1016/J.COR.2024.106760MaRDI QIDQ6979378zbMATH OpenFDO

Authors Sara Ceschia, Margaretha Gansterer, S. Mancini, Antonella Meneghetti

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106760

zbMATH Keywords

combinatorial optimizationon-demand warehousingonline algorithms

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Approximation and online algorithms for multidimensional bin packing: a survey
• Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
• scientific article; zbMATH DE number 2084697 (Why is no real title available?)
• Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization
• Online stochastic optimization under time constraints
• Online stochastic reservation systems
• Reinforcement Learning and Stochastic Optimization
• Stochastic optimization for vaccine and testing kit allocation for the COVID-19 pandemic
• Stochastic search for a parametric cost function approximation: energy storage with rolling forecasts
• Warehousing platform's revenue management: a dynamic model of coordinating space allocation for self-use and rent

This page was built for publication: Solving the online on-demand warehousing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979378)