The following pages link to (Q4526975):
Displaying 25 items.
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Average stretch without migration (Q1878679) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Open problems in queueing theory inspired by datacenter computing (Q2052428) (← links)
- The impact of processing order on performance: a taxonomy of semi-FIFO policies (Q2361355) (← links)
- SPT is optimally competitive for uniprocessor flow (Q2390257) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Scheduling in the dark (Q5918075) (← links)
