Pages that link to "Item:Q827589"

The following pages link to A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589):

Displaying 8 items.

• On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors (Q5053913) (← links)
• A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays (Q6487185) (← 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)