A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 218-229

  Karuno, Yoshiyuki ^a   Nagamochi, Hiroshi ^b  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; SCHEDULING; TRAVEL TIME; VEHICLES;

COMPLETION TIME; HANDLING TIME; MULTI-VEHICLES; NP-HARD; OPTIMAL SCHEDULE; RELEASE TIME; SCHEDULING PROBLEM;

JOB SHOP SCHEDULING;

EID: 84943232266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_18     Document Type: Conference Paper

References (15)

1. Asano, T., Katoh, N. and Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. Journal of Combinatorial Optimization, 5 (2001) 213-231.
2. Averbakh, I. and Berman, O.: Routing and location routing p-delivery men problems on a path. Transportation Science, 28 (1994) 162-166.
3. Averbakh, I. and Berman, O.: Sales-delivery man problems on treelike networks. Networks, 25 (1995) 45-58.
4. Averbakh, I. and Berman, O.: A heuristic with worst-case analysis for minmax routing of two traveling salesmen on a tree. Discrete Applied Mathematics, 68 (1996) 17-32.
5. Averbakh, I. and Berman, O.: (p−1)=(p+1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics, 75 (1997) 201-216.
6. Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F.: Time constrained routing and scheduling. In Ball, M. O., Magnanti, T. L., Monma, C. L. and Nemhauser, G. L. (eds.): Handbooks in Operations Research and Management Science Volume 8: Network Routing (North-Holland, 1995), 35-139.
7. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, San Francisco, 1979).
8. Karuno, Y., Nagamochi, H. and Ibaraki, T.: Vehicle scheduling on a tree to minimize maximum lateness. Journal of the Operations Research Society of Japan, 39 (1996) 345-355.
9. Karuno, Y., Nagamochi, H. and Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. Annals of Operations Research, 69 (1997) 193-207.
10. Karuno, Y., Nagamochi, H. and Ibaraki, T.: Computational complexity of the traveling salesman problem on a line with deadlines and general handling times. Memoirs of the Faculty of Engineering and Design, Kyoto Institute of Technology, 45 (1997) 19-22.
11. Karuno, Y., Nagamochi, H. and Ibaraki, T.: A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. Proceedings, ISCIE/ASME 1998 Japan-U.S.A. Symposium on Flexible Automation, 3 (1998) 1363-1366.
12. Nagamochi, H., Mochizuki, K. and Ibaraki, T.: Complexity of the single vehicle scheduling problem on graphs. Information Systems and Operations Research, 35 (1997) 256-276.
13. Nagamochi, H., Mochizuki, K. and Ibaraki, T.: Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree. IEICE Transactions: Fundamentals, E84-A (2001) 1135-1143.
14. Psaraftis, H., Solomon, M., Magnanti, T. and Kim, T.: Routing and scheduling on a shoreline with release times. Management Science, 36 (1990) 212-223.
15. Tsitsiklis, J. N.: Special cases of traveling salesman and repairman problems with time windows. Networks, 22 (1992) 263-282.