Routing and Scheduling on a Shoreline with Release Times
DOI10.1287/MNSC.36.2.212zbMATH Open0701.90050OpenAlexW2072400378MaRDI QIDQ3479797FDOQ3479797
Authors: Harilaos N. Psaraftis, Marius M. Solomon, Thomas L. Magnanti, Tai-Up Kim 
Publication date: 1990
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5219
Recommendations
- Complexity of routing problems with release dates
- Vehicle routing problems on a line-shaped network with release time constraints
- scientific article; zbMATH DE number 2080977
- Vehicle scheduling problems with two agents on a line
- Special cases of traveling salesman and repairman problems with time windows
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Cited In (43)
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Vehicle scheduling problems with two agents on a line
- Online TSP with known locations
- Discrete online TSP
- Online Vehicle Routing Problems: A Survey
- Approximating a vehicle scheduling problem with time windows and handling times
- Complexity of routing problems with release dates and deadlines
- Scheduling electric vehicles and locating charging stations on a path
- On the computational complexity of the patrol boat scheduling problem with complete coverage
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
- How to collect balls moving in the Euclidean plane
- Scheduling of waterways with tide and passing box
- Emergency path restoration problems
- Minimizing the total weighted delivery time in container transportation scheduling
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Complexity of routing problems with release dates
- Routing and scheduling problems with two agents on a line-shaped network
- The Steiner traveling salesman problem with online advanced edge blockages
- Minmax subtree cover problem on cacti
- Linear time approximation schemes for vehicle scheduling problems
- Cyclic inventory routing in a line-shaped network
- The single line moving target traveling salesman problem with release times
- Balancing profits and costs on trees
- Profit-based latency problems on the line
- Improved algorithms for single vehicle scheduling on tree/cycle networks
- Single-vehicle scheduling problem on a straight line with time window constraints
- Serving requests with on-line routing
- A reclaimer scheduling problem arising in coal stockyard management
- Finding optimal tour schedules on transportation paths under extended time window constraints
- Vehicle routing problems on a line-shaped network with release time constraints
- Ship scheduling: The last decade
- Routing problems: A bibliography
- Competitive algorithms for the on-line traveling salesman
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- Single-vehicle scheduling with time window constraints
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- 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
- How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring
- Two-agent vehicle scheduling problem on a line-shaped network
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
This page was built for publication: Routing and Scheduling on a Shoreline with Release Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479797)
