Abstract
We consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path [16]. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion [13]. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a linear time PTAS for the single vehicle scheduling problem on trees which have a constant number of leaves. This PTAS can be easily adapted to accommodate various starting/ending constraints. We then extended this to a PTAS for the multiple vehicle problem where vehicles operate in disjoint subtrees. For this problem, the only previous result is a 2-approximation algorithm for paths [10]. Finally, we present competitive online algorithms for some single vehicle scheduling problems.
This research was partially supported by the Research Competitiveness Subprogram of the Louisiana Board of Regents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., AND Talamo, M. Algorithms for the on-line travelling salesman. Algorithmica 29, 4 (2001), 560–581.
Bruno, J., AND Downey, P. Complexity of task sequencing with deadlines, setup times and changeover costs. SIAM Journal on Computing 7, 4 (Nov. 1978), 393–404.
Charikar, M., Motwani, R., Raghavan, P., AND Silverstein, C. Constrained TSP and low-power computing. In Proceedings of the 5th International Workshop on Algorithms and Data Structures (Aug. 1997), pp. 104–115.
Christofides, N. Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. CS-93-13, Carnegie Mellon University, Graduate School of Industrial Administration, 1976.
Desrosiers, J., Dumas, Y., Solomon, M., AND Soumis, F. Time constrained routing and scheduling. In Network Routing, Volume 8 of Handbooks in Operations Research and Management Science, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Eds. Elsevier Science, 1995.
Engebretsen, L., AND Karpinski, M. Approximation hardness of TSP with bounded metrics. In Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (July 2001), pp. 201–212.
Garey, M. R., AND Johnson, D. S.Computers and Intractability: A Guide to the theory of of NP-Completeness. Freeman and Company, San Francisco, 1979.
Hochbaum, D.Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997.
Karp, R. M.Reducibility Among Combinatorial Problems. Plenum Press, NY, 1972, pp. 85–103.
Karuno, Y., AND Nagamochi, H. A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. In Proceedings of the 9th Annual European Symposium on Algorithms (Aug. 2001), pp. 218–229.
Karuno, Y., AND Nagamochi, H. A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times. In Proceedings of the 12th International Symposium on Algorithms and Computation (Dec. 2001), pp. 36–47.
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.
Karuno, Y., Nagamochi, H., AND Ibaraki, T. A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. In Japan-U.S.A. Symposium on Flexible Automation (July 1998), pp. 1363–1366.
Nagamochi, H., Mochizuki, K., AND Ibaraki, T. Complexity of the single vehicle scheduling problem on graphs. INFOR: Information Systems and Operational Research 35, 4 (1997), 256–276.
Papadimitriou, C. H. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4, 3 (June 1977), 237–244.
Psaraftis, H., Solomon, M., Magnanti, T., AND Kim, T. Routing and scheduling on a shoreline with release times. Management Science 36, 2 (1990), 212–223.
Tsitsiklis, J. Special cases of traveling salesman and repairman problems with time windows. Networks 22 (1992), 263–282.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Augustine, J.E., Seiden, S.S. (2002). Linear Time Approximation Schemes for Vehicle Scheduling. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-45471-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43866-3
Online ISBN: 978-3-540-45471-7
eBook Packages: Springer Book Archive