The following pages link to (Q4636620):
Displaying 10 items.
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- (Q5090421) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
