Improved algorithms for single vehicle scheduling on tree/cycle networks
From MaRDI portal
Publication:2051909
DOI10.1007/S10878-019-00420-2zbMath1481.90191OpenAlexW2945560474WikidataQ127815213 ScholiaQ127815213MaRDI QIDQ2051909
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00420-2
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (2)
Scheduling on a graph with release times ⋮ Two-agent vehicle scheduling problem on a line-shaped network
Cites Work
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
- Vehicle routing problems on a line-shaped network with release time constraints
- Vehicle scheduling on a tree with release and handling times
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- Linear time approximation schemes for vehicle scheduling problems
- Approximation Algorithms for the Multi-Vehicle Scheduling Problem
- Single-vehicle scheduling problems with release and service times on a line
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
- Routing and Scheduling on a Shoreline with Release Times
- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
- Special cases of traveling salesman and repairman problems with time windows
- Complexity Of The Single Vehicle Scheduling Problem On Graphs
This page was built for publication: Improved algorithms for single vehicle scheduling on tree/cycle networks
