Routing and scheduling on a shoreline with release times
Management Science
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times
Information Processing Letters
Discrete Applied Mathematics
Theoretical Computer Science
Linear time approximation schemes for vehicle scheduling problems
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Vehicle routing problems on a line-shaped network with release time constraints
Operations Research Letters
Hi-index | 5.23 |
We consider the single vehicle scheduling problem in which the customers are located at the vertices of a tree or a cycle, and have release and service time requirements. The objective is to minimize the makespan. In the tour-version the makespan means the time when the vehicle returns to its initial location after serving all customers. While in the path-version the makespan refers to the maximum completion time of all customers. For the problem on a tree, we present a 9/5-approximation algorithm for the tour-version and a 27/14-approximation algorithm for the path-version. For the problem on a cycle, we present 12/7-approximation algorithms for both versions.