Approximation algorithms for the multi-vehicle scheduling problem

DOI10.1007/978-3-642-17514-5_17MaRDI QIDQ3060773zbMATH OpenOpenAlexFDO

Authors Binay Bhattacharya, Yuzhuang Hu

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17514-5_17

Mathematics Subject Classification ID

Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Recommendations

• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• scientific article; zbMATH DE number 1875418
• scientific article; zbMATH DE number 2080977
• Linear time approximation schemes for vehicle scheduling problems

Cited in

(17)

• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• 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
• New LP relaxations for minimum cycle/path/tree cover problems
• Better approximability results for min-max tree/cycle/path cover problems
• Approximating a vehicle scheduling problem with time windows and handling times
• Improved approximation algorithms for min-max and minimum vehicle routing problems
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• scientific article; zbMATH DE number 744104 (Why is no real title available?)
• scientific article; zbMATH DE number 1875418 (Why is no real title available?)
• The basic problem of vehicle scheduling can be solved by maximum bipartite matching
• Approximation algorithms for the capacitated min-max and minimum graph cover problems
• Approximating graphic min-max and minimum cycle/path/tree cover problems
• Approximation algorithms for the capacitated min-max and minimum graph cover problems

This page was built for publication: Approximation algorithms for the multi-vehicle scheduling problem

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