scientific article; zbMATH DE number 7051295
From MaRDI portal
Publication:4633939
Recommendations
- A polynomial time constant approximation for minimizing total weighted flow-time
- Algorithms for minimizing weighted flow time
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- Non-clairvoyant scheduling for weighted flow time
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine
- Weighted flow time bounds for scheduling identical processors
- AO(nm log(U/n)) time maximum flow algorithm
Cited in
(16)- Energy efficient scheduling of parallelizable jobs
- The online food delivery problem on stars
- Non-clairvoyantly scheduling to minimize convex functions
- scientific article; zbMATH DE number 1833400 (Why is no real title available?)
- Minimizing weighted flow time
- Non-preemptive flow-time minimization via rejections
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- scientific article; zbMATH DE number 7651147 (Why is no real title available?)
- Minimizing the maximum flow time in the online food delivery problem
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- A PTAS for minimizing weighted flow time on a single machine
- Minimizing weighted flow time
- Online weighted flow time and deadline scheduling
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 Q4633939)
