scientific article; zbMATH DE number 1559527
From MaRDI portal
Publication:4526975
Recommendations
- Approximating total flow time on parallel machines
- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- SRPT is 1.86-competitive for completion time scheduling
- scientific article; zbMATH DE number 1256760
Cited in
(37)- Non-clairvoyant scheduling for weighted flow time
- Maximizing job benefits on-line
- Fairness in parallel job scheduling
- Minimizing flow time on a constant number of machines with preemption
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Average stretch without migration
- Semi-clairvoyant scheduling
- Open problems in queueing theory inspired by datacenter computing
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- SPT is optimally competitive for uniprocessor flow
- Scheduling on unrelated machines under tree-like precedence constraints
- Greedy multiprocessor server scheduling
- Optimal on-line flow time with resource augmentation
- Designing PTASs for MIN-SUM scheduling problems
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- Online scheduling FIFO policies with admission and push-out
- Approximating total flow time on parallel machines
- Minimizing the flow time without migration
- Minimizing the Flow Time Without Migration
- Online flow time scheduling in the presence of preemption overhead
- Minimizing Average Flow Time on Unrelated Machines
- Minimizing Average Flow-Time
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines
- scientific article; zbMATH DE number 1256760 (Why is no real title available?)
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Optimizing busy time on parallel machines
- SRPT optimally utilizes faster machines to minimize flow time
- Fixed-parameter approximation schemes for weighted flowtime
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
- On minimizing the total flow time on multiple machines
- Scheduling in the dark
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
- A Modern View on Stability of Approximation
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Online weighted flow time and deadline scheduling
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526975)
