A labeling method for dynamic driver-task assignment with uncertain task durations
From MaRDI portal
Publication:2488239
DOI10.1016/J.ORL.2004.08.006zbMATH Open1090.90117OpenAlexW2022495805MaRDI QIDQ2488239FDOQ2488239
Authors: 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
Recommendations
- Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach
- A new hybrid heuristic for driver scheduling
- Dynamic policies for uncertain time‐critical tasking problems
- scientific article; zbMATH DE number 1057929
- Adaptive labeling algorithms for the dynamic assignment problem
- Driver scheduling based on “driver-friendly” vehicle schedules
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- A solution approach for dynamic vehicle and crew scheduling
Cites Work
- Title not available (Why is that?)
- The Vehicle Routing Problem with Stochastic Travel Times
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Routing with time windows by column generation
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
- Adaptive labeling algorithms for the dynamic assignment problem
Cited In (2)
This page was built for publication: A labeling method for dynamic driver-task assignment with uncertain task durations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488239)
