Algorithms for minimizing weighted flow time
From MaRDI portal
Recommendations
- Minimizing weighted flow time
- scientific article; zbMATH DE number 2079378
- A polynomial time constant approximation for minimizing total weighted flow-time
- An algorithm for flow time minimization and its asymptotic makespan properties
- A fast algorithm for the minimax flow problem with 0/1 weights
- Algorithms for flows over time with scheduling costs
- Algorithms for Flows over Time with Scheduling Costs
- Fixed-parameter approximation schemes for weighted flowtime
- Mean flow time minimization with given bounds of processing times
- Algorithms for minimum flows.
Cites work
Cited in
(39)- Non-clairvoyant scheduling for weighted flow time
- Improved lower bounds for online scheduling to minimize total stretch
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Lower bounds for on-line single-machine scheduling.
- An optimal online algorithm for single-processor scheduling problem with learning effect
- Non-clairvoyantly scheduling to minimize convex functions
- Improved multi-processor scheduling for flow time and energy
- Greedy multiprocessor server scheduling
- Designing PTASs for MIN-SUM scheduling problems
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- Approximating total flow time on parallel machines
- From preemptive to non-preemptive scheduling using rejections
- Minimizing Average Flow-Time
- scientific article; zbMATH DE number 3906196 (Why is no real title available?)
- scientific article; zbMATH DE number 2079378 (Why is no real title available?)
- scientific article; zbMATH DE number 7051295 (Why is no real title available?)
- scientific article; zbMATH DE number 1833400 (Why is no real title available?)
- Minimizing weighted flow time
- Energy-efficient algorithms for flow time minimization
- Fixed-parameter approximation schemes for weighted flowtime
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- Algorithms for Flows over Time with Scheduling Costs
- 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
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- Weighted flowtime on capacitated machines
- Resource augmentation for weighted flow-time explained by dual fitting
- Joint replenishment meets scheduling
- 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
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- A PTAS for minimizing weighted flow time on a single machine
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- Parameterized algorithms and complexity for scheduling with precedence constraints and time windows
- Minimizing weighted flow time
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- Online weighted flow time and deadline scheduling
- Scheduling and fixed-parameter tractability
This page was built for publication: Algorithms for minimizing weighted flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175956)
