A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
From MaRDI portal
Publication:1007578
DOI10.1016/S0020-0190(02)00474-XzbMath1156.90363OpenAlexW2043046759MaRDI QIDQ1007578
Daya Ram Gaur, Ramesh Krishnamurti, Arvind Kumar Gupta
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00474-x
Related Items (13)
The multiple traveling salesman problem on spiders ⋮ An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ Routing open shop and flow shop scheduling problems ⋮ Scheduling on a graph with release times ⋮ Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle ⋮ Emergency path restoration problems ⋮ Data mule scheduling on a path with handling time and time span constraints ⋮ Single-vehicle scheduling problems with release and service times on a line ⋮ Improved algorithms for single vehicle scheduling on tree/cycle networks ⋮ Vehicle routing problems on a line-shaped network with release time constraints ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ Vehicle scheduling problems with two agents on a line
Cites Work
This page was built for publication: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
