Pages that link to "Item:Q1874274"

The following pages link to On the parametric complexity of schedules to minimize tardy tasks. (Q1874274):

Displaying 19 items.

• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← 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)
• Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• (Q6068238) (← links)
• (Q6089672) (← links)
• Equitable scheduling on a single machine (Q6103750) (← 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)