Pages that link to "Item:Q2401169"
From MaRDI portal
The following pages link to A quasi-polynomial approximation for the restricted assignment problem (Q2401169):
Displaying 10 items.
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- A note on the integrality gap of the configuration LP for restricted Santa Claus (Q2203609) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- (Q5091233) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- Compact LP Relaxations for Allocation Problems (Q5240426) (← links)