Routing and Scheduling on a Shoreline with Release Times

DOI10.1287/MNSC.36.2.212zbMath0701.90050OpenAlexW2072400378MaRDI QIDQ3479797

Marius M. Solomon, Harilaos N. Psaraftis, Tai-Up Kim, Thomas L. Magnanti

Publication date: 1990

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5219

zbMATH Keywords

heuristicsworst-case performancepolynomial time algorithmsrelease time constraintsshoreline routing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (37)

Scheduling electric vehicles and locating charging stations on a path ⋮ 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 ⋮ Serving requests with on-line routing ⋮ Competitive algorithms for the on-line traveling salesman ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ Cyclic inventory routing in a line-shaped network ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ Finding optimal tour schedules on transportation paths under extended time window constraints ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ How to collect balls moving in the Euclidean plane ⋮ The single line moving target traveling salesman problem with release times ⋮ Routing problems: A bibliography ⋮ Balancing profits and costs on trees ⋮ Single-vehicle scheduling problem on a straight line with time window constraints ⋮ How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring ⋮ Online TSP with known locations ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Two-agent vehicle scheduling problem on a line-shaped network ⋮ Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle ⋮ Emergency path restoration problems ⋮ Profit-based latency problems on the line ⋮ Online Vehicle Routing Problems: A Survey ⋮ Approximating a vehicle scheduling problem with time windows and handling times ⋮ Minmax subtree cover problem on cacti ⋮ A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times ⋮ 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 ⋮ Improved algorithms for single vehicle scheduling on tree/cycle networks ⋮ Vehicle routing problems on a line-shaped network with release time constraints ⋮ Discrete online TSP ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ Single-vehicle scheduling with time window constraints ⋮ Vehicle scheduling problems with two agents on a line ⋮ Ship scheduling: The last decade ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

This page was built for publication: Routing and Scheduling on a Shoreline with Release Times