Pages that link to "Item:Q1928505"
From MaRDI portal
The following pages link to Online scheduling on uniform machines with two hierarchies (Q1928505):
Displaying 8 items.
- Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
- 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 optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
- Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
