Pages that link to "Item:Q2941582"
From MaRDI portal
The following pages link to Minimizing Flow-Time on Unrelated Machines (Q2941582):
Displaying 8 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Single source unsplittable flows with arc-wise lower and upper bounds (Q2118142) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- On Minimizing Flow Time on Processors with Variable Unit Processing Time (Q3755220) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines (Q5326546) (← 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)