On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
From MaRDI portal
Publication:6535285
Recommendations
- On the parameterized tractability of single machine scheduling with rejection
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- Single machine scheduling with rejection to minimize the weighted makespan
- Scheduling and fixed-parameter tractability
- Scheduling and fixed-parameter tractability
Cites work
- scientific article; zbMATH DE number 6490206 (Why is no real title available?)
- scientific article; zbMATH DE number 503190 (Why is no real title available?)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- A survey on offline scheduling with rejection
- An application of simultaneous diophantine approximation in combinatorial optimization
- An improved heuristic for parallel machine scheduling with rejection
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Approximation scheme for single-machine rescheduling with job delay and rejection
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Multiprocessor Scheduling with Rejection
- On the parametric complexity of schedules to minimize tardy tasks.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized algorithms
- Parametrized complexity theory.
- Penalty cost constrained identical parallel machine scheduling problem
- Scheduling and fixed-parameter tractability
- Scheduling meets \(n\)-fold integer programming
- Single machine scheduling with rejection to minimize the weighted makespan
- Single machine scheduling with release dates and rejection
- Vector scheduling with rejection on a single machine
- Vector scheduling with rejection on two machines
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
This page was built for publication: On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535285)