Pages that link to "Item:Q287232"
From MaRDI portal
The following pages link to Fair on-line scheduling of a dynamic set of tasks on a single resource (Q287232):
Displaying 8 items.
- Smooth scheduling under variable rates or the analog-digital confinement game (Q733734) (← links)
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks (Q880554) (← links)
- On the chairman assignment problem (Q1126200) (← links)
- Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
- Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements (Q2294049) (← links)
- Guaranteeing Fair Service to Persistent Dependent Tasks (Q4210089) (← links)
- Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach (Q4498115) (← links)
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms (Q5705387) (← links)