Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
From MaRDI portal
Publication:5963621
DOI10.1007/S10878-014-9744-YzbMATH Open1337.90031OpenAlexW2085518973MaRDI QIDQ5963621FDOQ5963621
Authors: Kejun Zhao, Xiwen Lu 
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9744-y
Recommendations
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Approximation schemes for two-agent scheduling on parallel machines
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- A multiple-criterion model for machine scheduling
- 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
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Two-agent scheduling on uniform parallel machines with min-max criteria
- 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
- Analyzing scheduling with transient failures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Scheduling interfering job sets on parallel machines
- Approximation schemes for two-machine flow shop scheduling with two agents
- Approximation schemes for two-agent scheduling on parallel machines
Cited In (10)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- 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
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Approximation schemes for two-agent scheduling on parallel machines
This page was built for publication: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963621)
