Single-vehicle scheduling with time window constraints
From MaRDI portal
Publication:1297696
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199907/08)2:4<175::AID-JOS24>3.0.CO;2-S" /><175::AID-JOS24>3.0.CO;2-S 10.1002/(SICI)1099-1425(199907/08)2:4<175::AID-JOS24>3.0.CO;2-SzbMath0941.90042MaRDI QIDQ1297696
Gilbert H. Young, Chi-Lok Chan
Publication date: 12 September 1999
Published in: Journal of Scheduling (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Approximating a vehicle scheduling problem with time windows and handling times
Cites Work
- Unnamed Item
- Unnamed Item
- The pickup and delivery problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Routing and Scheduling on a Shoreline with Release Times
- Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
This page was built for publication: Single-vehicle scheduling with time window constraints
