Two-agent vehicle scheduling problem on a line-shaped network
From MaRDI portal
Publication:2691417
DOI10.3934/jimo.2022152OpenAlexW4293215202MaRDI QIDQ2691417
Hao Yan, Peihai Liu, Xi-wen Lu
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022152
Cites Work
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Vehicle routing problems on a line-shaped network with release time constraints
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Improved algorithms for single vehicle scheduling on tree/cycle networks
- Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm
- Two-agent scheduling on a single machine with release dates
- Unbounded parallel-batching scheduling with two competitive agents
- Single-vehicle scheduling problems with release and service times on a line
- Routing and Scheduling on a Shoreline with Release Times
- Special cases of traveling salesman and repairman problems with time windows
- Single machine just‐in‐time scheduling problems with two competing agents
- Multiagent Scheduling
This page was built for publication: Two-agent vehicle scheduling problem on a line-shaped network
