Pages that link to "Item:Q719259"
From MaRDI portal
The following pages link to Improved bounds for online scheduling with eligibility constraints (Q719259):
Displayed 10 items.
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)