Pages that link to "Item:Q1779706"
From MaRDI portal
The following pages link to Minimizing flow time on a constant number of machines with preemption (Q1779706):
Displaying 5 items.
- Minimizing the flow time without migration (Q2819546) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time (Q5236280) (← links)
- Minimizing Maximum Flow-time on Related Machines (Q5351891) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)