Pages that link to "Item:Q1919171"

The following pages link to \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171):

Displaying 24 items.

• A model for minimizing active processor time (Q487001) (← links)
• A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
• On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
• Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
• Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract) (Q2817636) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• (Q6068238) (← links)
• (Q6089672) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
• Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
• Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)