Pages that link to "Item:Q924724"
From MaRDI portal
The following pages link to Preemptive scheduling on a small number of hierarchical machines (Q924724):
Displayed 12 items.
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)