A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
DOI10.1007/S10951-015-0460-YzbMATH Open1341.90061OpenAlexW2285763352MaRDI QIDQ283263FDOQ283263
Authors: Kejun Zhao, Manzhan Gu, Xiwen Lu 
Publication date: 13 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0460-y
Recommendations
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Approximation schemes for two-agent scheduling on parallel machines
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Multiagent scheduling. Models and algorithms
- Bounds on Multiprocessing Timing Anomalies
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A decomposition scheme for single stage scheduling problems
- Analyzing scheduling with transient failures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Cited In (11)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Two-agent scheduling on a single machine with release dates
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- An approximation algorithm for scheduling on three dedicated machines
- Two-agent parallel-machine scheduling with rejection
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Two-agent vehicle scheduling problem on a line-shaped network
- Approximation schemes for two-agent scheduling on parallel machines
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
This page was built for publication: A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283263)
