Scheduling of vehicles in transportation networks

Dariusz Kowalski, Zeev Nutov, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageAmerican English
Title of host publicationCommunication Technologies for Vehicles - 4th International Workshop, Nets4Cars/Nets4Trains 2012, Proceedings
Pages124-136
Number of pages13
DOIs
StatePublished - 15 Jun 2012
Event4th International Workshop on Communication Technologies for Vehicles, Nets4Cars/Nets4Trains 2012 - Vilnius, Lithuania
Duration: 25 Apr 201227 Apr 2012

Publication series

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

Conference

Conference4th International Workshop on Communication Technologies for Vehicles, Nets4Cars/Nets4Trains 2012
Country/TerritoryLithuania
CityVilnius
Period25/04/1227/04/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Scheduling of vehicles in transportation networks'. Together they form a unique fingerprint.

Cite this