The following pages link to (Q4471337):
Displaying 12 items.
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Non-clairvoyant Speed Scaling for Weighted Flow Time (Q3586448) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- Algorithms for minimizing weighted flow time (Q5175956) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)