Pages that link to "Item:Q1928505"
From MaRDI portal
The following pages link to Online scheduling on uniform machines with two hierarchies (Q1928505):
Displaying 20 items.
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Online scheduling on three uniform machines (Q765372) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- 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 scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← 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)
- (Q2766832) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- (Q4252304) (← 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)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)