Pages that link to "Item:Q2400435"

The following pages link to A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435):

Displaying 16 items.

• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← 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)
• Efficient algorithms for scheduling parallel jobs with interval constraints in clouds (Q2149869) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Single courier single restaurant meal delivery (without routing) (Q2294375) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• On topological models of zero entropy loosely Bernoulli systems (Q5098830) (← links)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• Throughput scheduling with equal additive laxity (Q5918523) (← links)
• Throughput scheduling with equal additive laxity (Q5925675) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)