Pages that link to "Item:Q2343998"
From MaRDI portal
The following pages link to Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998):
Displayed 9 items.
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements (Q6167006) (← links)