The following pages link to (Q5743472):
Displaying 18 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Non-Preemptive Flow-Time Minimization via Rejections (Q5002748) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- (Q6087217) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
