Pages that link to "Item:Q1782183"

The following pages link to Parameterized complexity of machine scheduling: 15 open problems (Q1782183):

Displaying 32 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 the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← 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)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
• An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
• (Q5089171) (← links)
• Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
• (Q6068238) (← links)
• Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
• (Q6089672) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
• A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)