Linear time approximation schemes for vehicle scheduling problems

Theoretical Computer Science

Volumn 324, Issue 2-3 SPEC. ISS., 2004, Pages 147-160

  Augustine, John E ^a   Seiden, Steven ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Dynamic programming; Polynomial time approximation scheme; Vehicle scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEME; VEHICLE SCHEDULING;

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; LINEAR SYSTEMS; MATHEMATICAL MODELS; SCHEDULING;

COMPUTER SCIENCE;

EID: 4444250393     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.05.013     Document Type: Article

References (18)

1. J.E. Augustine, Offline and online variants of the traveling salesman problem, Masters Thesis, Louisiana State University, 2002.
2. Bruno J., Downey P. Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput. 7(4):1978;393-404.
3. M. Charikar, R. Motwani, P. Raghavan, C. Silverstein, Constrained TSP and low-power computing, in: Proc. 5th Internat. Workshop on Algorithms and Data Structures, (1997) 104-115.
4. N. Christofides, Vehicle routing, The Traveling Salesman Problem, Wiley, New York, 1985, 431-448.
5. Desrosiers J., Dumas Y., Solomon M., Soumis F. Time constrained routing and scheduling. Ball M.O., Magnanti T.L., Monma C.L., Nemhauser G.L. Network Routing. Handbooks in Operations Research and Management Science. Vol. 8:1995;Elsevier, Amsterdam.
6. Garey M.R., Johnson D.S. Computers and Intractability: a Guide to the Theory of NP-completeness. 1979;Freeman and Company, San Francisco.
7. D. Hochbuam, Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997.
8. R.M. Karp, Reducibility among Combinatorial Problems, Plenum Press, New York, 1972, pp. 85-103.
9. Y. Karuno, H. Nagamochi, A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times, in: Proc. 12th Internat. Sympos. Algorithms and Comput. (2001) 36-47.
10. Karuno Y., Nagamochi H. 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discrete Appl. Math. 129:2003;433-447.
11. Karuno Y., Nagamochi H., Ibaraki T. Vehicle scheduling on a tree to minimize maximum lateness. J. Oper. Res. Soc. Japan. 39(3):1996;345-355.
12. Karuno Y., Nagamochi H., Ibaraki T. Vehicle scheduling on a tree with release and handling times. Ann. Oper. Res. 69:1997;193-207.
13. Y. Karuno, H. Nagamochi, T. Ibaraki, 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, Vol. 45, 1997, pp. 19-22.
14. Y. Karuno, H. Nagamochi, T. Ibaraki, A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times, in: Japan - USA Symp. on Flexible Automat., July 1998, pp. 1363-1366.
15. Nagamochi H., Mochizuki K., Ibaraki T. Complexity of the single vehicle scheduling problem on graphs. INFOR: Inform. Systems Oper. Res. 35(4):1997;256-276.
16. Papadimitriou C.H. The Euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3):1977;237-244.
17. Psaraftis H., Solomon M., Magnanti T., Kim T. Routing and scheduling on a shoreline with release times. Manage. Sci. 36(2):1990;212-223.
18. Tsitsiklis J. Special cases of traveling salesman and repairman problems with time windows. Networks. 22:1992;263-282.