Minimizing the weighted number of tardy jobs is W[1]-hard
From MaRDI portal
Publication:7253132
Cites work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Algorithms for Scheduling Independent Tasks
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds on Multiprocessing Timing Anomalies
- Faster minimization of tardy processing time on a single machine
- Fundamentals of parameterized complexity
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Integer Programming with a Fixed Number of Variables
- Minimizing the weighted number of tardy jobs via (,+)-convolutions
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs
- On problems equivalent to \((\min,+)\)-convolution
- On the complexity of k-SAT
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Parameterized complexity of machine scheduling: 15 open problems
- Parameterizing by the number of numbers
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Quick minimization of tardy processing time on a single machine
- Reducibility among combinatorial problems
- The subspace flatness conjecture and faster integer programming
Cited in
(2)
This page was built for publication: Minimizing the weighted number of tardy jobs is W[1]-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253132)
