Two-agent parallel-machine scheduling with rejection
From MaRDI portal
Publication:1676363
DOI10.1016/j.tcs.2017.09.004zbMath1380.90122OpenAlexW2751274294MaRDI QIDQ1676363
Publication date: 7 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.004
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling, Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
Cites Work
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- A survey on offline scheduling with rejection
- Two-agent scheduling to minimize the total cost
- Parallel-machine scheduling with deteriorating jobs and rejection
- A note on the scheduling with two families of jobs
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Preemptive scheduling with rejection
- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- Approximation schemes for two-agent scheduling on parallel machines
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent scheduling with rejection on a single machine
- A multiple-criterion model for machine scheduling
- An improved heuristic for parallel machine scheduling with rejection
- Scheduling with Rejection to Minimize the Makespan
- Scheduling Problems with Two Competing Agents
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Multiagent Scheduling
- Algorithms and Data Structures
