Pages that link to "Item:Q3452502"
From MaRDI portal
The following pages link to Minimizing flow time nonclairvoyantly (Q3452502):
Displaying 10 items.
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor (Q693765) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Utilization of nonclairvoyant online schedules (Q2508980) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- An Optimal Strategy for Online Non-uniform Length Order Scheduling (Q3511440) (← links)
- Achievable Performance of Blind Policies in Heavy Traffic (Q5219677) (← links)
- Scheduling in the dark (Q5918075) (← links)