Pages that link to "Item:Q5096939"
From MaRDI portal
The following pages link to Randomized algorithms for that ancient scheduling problem (Q5096939):
Displaying 6 items.
- Optimal randomized scheduling by replacement (Q1383803) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- (Q3640352) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)