Pages that link to "Item:Q3133204"

The following pages link to Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204):

Displaying 23 items.

• 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)
• On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← 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)
• The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
• A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
• Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
• On recognising words that are squares for the shuffle product (Q2699216) (← links)
• (Q3217918) (← links)
• (Q3396634) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
• Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)