Pages that link to "Item:Q5937432"
From MaRDI portal
The following pages link to Randomized on-line scheduling on two uniform machines (Q5937432):
Displaying 8 items.
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- (Q4252304) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)