Routing and scheduling problems with two agents on a line-shaped network

DOI10.1007/978-3-030-92681-6_18OpenAlexW4206207590MaRDI QIDQ2149871

Hao Yan, Xi-wen Lu

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_18

zbMATH Keywords

approximation algorithmpolynomial time algorithmnetwork schedulingagent scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• 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
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Single-vehicle scheduling problems with release and service times on a line
• 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

This page was built for publication: Routing and scheduling problems with two agents on a line-shaped network