Vehicle scheduling problems with two agents on a line

DOI10.1007/s10878-022-00933-3OpenAlexW4309581702MaRDI QIDQ2099389

Hao Yan, Peihai Liu, Xi-wen Lu

Publication date: 23 November 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00933-3

zbMATH Keywords

approximation algorithmpolynomial time algorithmnetwork schedulingagent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
• Linear time approximation schemes for vehicle scheduling problems
• Approximation schemes for two-agent scheduling on parallel machines
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A multiple-criterion model for machine scheduling
• Multi-agent single machine scheduling
• Single-vehicle scheduling problems with release and service times on a line
• Competitive Two-Agent Scheduling and Its Applications
• Routing and Scheduling on a Shoreline with Release Times
• Scheduling Problems with Two Competing Agents
• Special cases of traveling salesman and repairman problems with time windows
• Complexity Of The Single Vehicle Scheduling Problem On Graphs

This page was built for publication: Vehicle scheduling problems with two agents on a line