Improved algorithms for single vehicle scheduling on tree/cycle networks

Yuanxiao Wu () and Xiwen Lu ()
Additional contact information
Yuanxiao Wu: East China University of Science and Technology
Xiwen Lu: East China University of Science and Technology

Journal of Combinatorial Optimization, No 0, 16 pages

Abstract: Abstract The single vehicle scheduling problems based on tree/cycle networks are studied in this paper. Each customer, assumed as a vertex on the given network, has a release time and a service time requirement. The single vehicle starts from the depot and aims to serve all the customers. The objective of the problem is to find the optimal routing schedule so as to minimize the makespan. We provide a $$\frac{16}{9}$$ 16 9 -approximation algorithm and a $$\frac{48}{25}$$ 48 25 -approximation algorithm for the tour-version and path-version of single vehicle scheduling problem on a tree, respectively. For the tour-version and path-version of single vehicle scheduling problem on a cycle, we present a $$\frac{5}{3}$$ 5 3 -approximation algorithm and a $$\frac{29}{17}$$ 29 17 -approximation algorithm, respectively.

Keywords: Vehicle; Routing; Scheduling; Network; Approximation algorithm (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00420-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00420-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00420-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().