Pages that link to "Item:Q3150129"
From MaRDI portal
The following pages link to Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129):
Displaying 11 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)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← 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)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
