Pages that link to "Item:Q813965"
From MaRDI portal
The following pages link to On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965):
Displaying 13 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- On-line service scheduling (Q835637) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- An optimal algorithm for preemptive on-line scheduling (Q1919176) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness (Q2479534) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- Minimizing maximum flow-time on related machines (Q2830868) (← links)
- (Q4782742) (← links)
- Algorithm Theory - SWAT 2004 (Q5315393) (← links)
- Fundamentals of Computation Theory (Q5900785) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)