The following pages link to (Q4633939):
Displaying 11 items.
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- The online food delivery problem on stars (Q2079861) (← 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)
- Non-Preemptive Flow-Time Minimization via Rejections (Q5002748) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- (Q5874472) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
