Scheduling of vehicles in transportation networks

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider online vehicle scheduling problems for different network topologies under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times and present a number of provable approximate solutions. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Kowalski, D., Nutov, Z., & Segal, M. (2012). Scheduling of vehicles in transportation networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7266 LNCS, pp. 124–136). https://doi.org/10.1007/978-3-642-29667-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free