Data mule scheduling on a path with handling time and time span constraints

DOI10.1007/s11590-019-01463-4zbMath1459.90090OpenAlexW2968309780MaRDI QIDQ2228361

Yingli Ran, Zhao Zhang, Yishuo Shi, Ding-Zhu Du, Zhihao Chen

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01463-4

zbMATH Keywords

computational complexityapproximation algorithmhandling timedata mule schedulingtime span constraint

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints ⋮ Approximation algorithms for some minimum postmen cover problems

Cites Work

• A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• Approximation algorithms for distance constrained vehicle routing problems
• A Mobile Data Gathering Framework for Wireless Rechargeable Sensor Networks with Vehicle Movement Costs and Capacity Constraints
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
• Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
• Special cases of traveling salesman and repairman problems with time windows
• Unnamed Item

This page was built for publication: Data mule scheduling on a path with handling time and time span constraints