Vehicle scheduling on a tree with release and handling times
From MaRDI portal
Publication:1357781
DOI10.1023/A:1018928911513zbMath0880.90037OpenAlexW36531276MaRDI QIDQ1357781
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
Publication date: 16 June 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018928911513
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (15)
Approximation algorithms for distance constrained vehicle routing problems ⋮ An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Linear time approximation schemes for vehicle scheduling problems ⋮ The single line moving target traveling salesman problem with release times ⋮ Balancing profits and costs on trees ⋮ Submodularity and the traveling salesman problem ⋮ Routing open shop and flow shop scheduling problems ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times ⋮ Improved algorithms for single vehicle scheduling on tree/cycle networks ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ Two short notes on the on-line travelling salesman: handling times and lookahead. ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
This page was built for publication: Vehicle scheduling on a tree with release and handling times
