Vehicle scheduling on a tree with release and handling times

  • Yoshiyuki Karuno
  • Hiroshi Nagamochi
  • Toshihide Ibaraki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 762)


Let T=(V, E,v0) be a rooted tree, where V is a set of n vertices, E is a set of edges and v0V is the root. The travel times d(vi,vj) and d(vj,vi) are associated with each edge (vi,vj) ∃ E, and a job, which is also denoted as vi, is located at each vertex vi. Each job vi has release time r(vj) and handling time h(vi). The TREE-VSP (Vehicle Scheduling Problem on a Tree) asks to find a routing schedule of the vehicle such that it starts from root v0, visits all jobs vi ∃ V for processing, and returns to v0. The processing of a job vi cannot be started before its release time t=r(vi) (hence the vehicle may have to wait if it arrives at vi too early) and takes h(vi) time units once its processing has been started (no interruption is allowed). The objective is to find a schedule that minimizes the completion time (i.e., the time to return to v0 after processing all jobs). We first prove that TREE-VSP is NP-hard. Then we show that TREE-VSP with depth-first routing constraint can be exactly solved in θ(n log n) time. Finally we show that, if we regard this exact algorithm as an approximate algorithm for TREE-VSP without such routing constraint, its worst-case ratio is at most two, and that this bound is tight.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atallah, M. and S. Kosaraju, Efficient solutions to some transportation problems with application to minimizing robot arm travel, SIAM J. Comput., 17(1988), 849–869.CrossRefGoogle Scholar
  2. 2.
    Baker, E., An Exact Algorithm for the Time-Constraint Traveling Salesman Problem, Operations Research, 31–5(1983), 938–945.Google Scholar
  3. 3.
    Bramel, J., E. Coffman, Jr., P. Shor and D. Simchi-Levi, Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands, Operations Research, 40–6(1992), 1095–1106.Google Scholar
  4. 4.
    Dell'Amico, M., M. Fischetti and P. Toth, Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem, Management Science, 39–1(1993), 115–125.Google Scholar
  5. 5.
    Frederickson, G., A Note on the Complexity of a Simple Transportation Problem, SIAM J. Comput., 22–1(1993), 57–61.CrossRefGoogle Scholar
  6. 6.
    Frederickson, G. and D. Guan, Preemptive Ensemble Motion Planning on a Tree, SIAM J. Comput., 21–6(1992), 1130–1152.CrossRefGoogle Scholar
  7. 7.
    Frederickson, G., M. Hecht and C. Kim, Approximation Algorithms for Some Routing Problems, SIAM J. Comput., 7–2(1978), 178–193.CrossRefGoogle Scholar
  8. 8.
    Garey, M. and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.Google Scholar
  9. 9.
    Psaraftis, H., M. Solomon, T. Magnanti and T. Kim, Routing and Scheduling on a Shoreline with Release Times, Management Science, 36–2(1990), 212–223.Google Scholar
  10. 10.
    Solomon, M., Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research, 35–2(1987), 254–265.MathSciNetGoogle Scholar
  11. 11.
    Solomon, M. and J. Desrosiers, Time Window Constrained Routing and Scheduling Problems: A Survey, Transportation Sci., 22(1988), 1–13.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Yoshiyuki Karuno
    • 1
  • Hiroshi Nagamochi
    • 2
  • Toshihide Ibaraki
    • 2
  1. 1.Department of Mechanical and System EngineeringKyoto Institute of TechnologyJapan
  2. 2.Department of Applied Mathematics and PhysicsKyoto UniversityJapan

Personalised recommendations