Pages that link to "Item:Q2819546"
From MaRDI portal
The following pages link to Minimizing the flow time without migration (Q2819546):
Displayed 10 items.
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Average stretch without migration (Q1878679) (← links)
- SPT is optimally competitive for uniprocessor flow (Q2390257) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)