Pages that link to "Item:Q1007578"
From MaRDI portal
The following pages link to A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578):
Displaying 13 items.
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- Emergency path restoration problems (Q435733) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- Routing and scheduling problems with two agents on a line-shaped network (Q2149871) (← links)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)