Two-agent parallel-machine scheduling with rejection
From MaRDI portal
Recommendations
- Two-agent scheduling with rejection on a single machine
- A full polynomial-time approximation scheme of two-agent scheduling with job rejection
- Scheduling with release times and rejection on two parallel machines
- Parallel-machine scheduling with release dates and rejection
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
Cites work
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- A multiple-criterion model for machine scheduling
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- A note on the scheduling with two families of jobs
- A survey on offline scheduling with rejection
- Algorithms and Data Structures
- An improved heuristic for parallel machine scheduling with rejection
- Approximation schemes for two-agent scheduling on parallel machines
- Multiagent scheduling. Models and algorithms
- Multiprocessor Scheduling with Rejection
- Parallel-machine scheduling with deteriorating jobs and rejection
- Preemptive scheduling with rejection
- Scheduling Problems with Two Competing Agents
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling with Rejection to Minimize the Makespan
- Single machine scheduling with two competing agents and equal job processing times
- Techniques for scheduling with rejection
- Two-agent scheduling to minimize the total cost
- Two-agent scheduling with rejection on a single machine
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(9)- Two-agent scheduling with rejection on a single machine
- Two-agent single machine scheduling with batch delivery and rejection
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- A full polynomial-time approximation scheme of two-agent scheduling with job rejection
- Scheduling with competing agents, total late work and job rejection
- Single-machine scheduling with coupled task and rejection
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
This page was built for publication: Two-agent parallel-machine scheduling with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676363)
