Pages that link to "Item:Q5363760"
From MaRDI portal
The following pages link to Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760):
Displaying 8 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)
- 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)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
