Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
From MaRDI portal
Publication:5963621
DOI10.1007/s10878-014-9744-yzbMath1337.90031OpenAlexW2085518973MaRDI QIDQ5963621
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
Cites Work
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Analyzing scheduling with transient failures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- 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
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan