On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan

DOI10.1007/978-981-19-8152-4_17zbMATH Open1541.90173MaRDI QIDQ6535285FDOQ6535285

Authors: Ruiqing Sun 

Publication date: 2 December 2023

zbMATH Keywords

scheduling with rejectionfixed-parameter tractabilityparameterized complexityweighted makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with release dates and rejection
• Parametrized complexity theory.
• A survey on offline scheduling with rejection
• Parameterized algorithms
• Multiprocessor Scheduling with Rejection
• An application of simultaneous diophantine approximation in combinatorial optimization
• Single machine scheduling with rejection to minimize the weighted makespan
• Title not available (Why is that?)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
• Scheduling meets \(n\)-fold integer programming
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
• An improved heuristic for parallel machine scheduling with rejection
• Penalty cost constrained identical parallel machine scheduling problem
• Title not available (Why is that?)
• Scheduling and fixed-parameter tractability
• On the parametric complexity of schedules to minimize tardy tasks.
• A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
• Vector scheduling with rejection on a single machine
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• A general scheme for solving a large set of scheduling problems with rejection in FPT time
• Vector scheduling with rejection on two machines
• Approximation scheme for single-machine rescheduling with job delay and rejection

Cited In (1)

• On the parameterized tractability of single machine scheduling with rejection

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)