A labeling method for dynamic driver-task assignment with uncertain task durations
From MaRDI portal
Publication:2488239
DOI10.1016/j.orl.2004.08.006zbMath1090.90117OpenAlexW2022495805MaRDI QIDQ2488239
Raymond K. Cheung, Darren D. Hang, Ning Shi
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.08.006
Related Items (1)
Cites Work
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Adaptive Labeling Algorithms for the Dynamic Assignment Problem
- Routing with time windows by column generation
- Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- The Vehicle Routing Problem with Stochastic Travel Times
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
This page was built for publication: A labeling method for dynamic driver-task assignment with uncertain task durations