Complexity Of The Single Vehicle Scheduling Problem On Graphs

DOI10.1080/03155986.1997.11732334MaRDI QIDQ4380541zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi, Koji Mochizuki, Toshihide Ibaraki

Publication date 7 September 1998

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1997.11732334

zbMATH Keywords

strong NP-hardnessvehicle scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Vehicle scheduling on a tree with release and handling times
• Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
• VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
• scientific article; zbMATH DE number 2080977
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Cited in

(16)

• Single-vehicle scheduling with time window 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.
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
• 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
• Improved algorithms for single vehicle scheduling on tree/cycle networks
• Vehicle scheduling problems with two agents on a line
• Complexity of routing problems with release dates
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
• scientific article; zbMATH DE number 1947061 (Why is no real title available?)
• Vehicle scheduling on a graph revisited
• Single-vehicle scheduling problem on a straight line with time window constraints
• Scheduling on a graph with release times
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme

This page was built for publication: Complexity Of The Single Vehicle Scheduling Problem On Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380541)