Fast fully polynomial approximation schemes for minimizing completion time variance
From MaRDI portal
Recommendations
- A half-product based approximation scheme for agreeably weighted completion time variance
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Multi-machine scheduling with variance minimization
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
Cites work
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Algorithms for Scheduling Independent Tasks
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
- Completion time variance minimization on a single machine is difficult
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Mimimization of agreeably weighted variance in single machine systems
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- New results on the completion time variance minimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Proof of a conjecture of Schrage about the completion time variance problem
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(14)- AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean
- A half-product based approximation scheme for agreeably weighted completion time variance
- FPTAS for half-products minimization with scheduling applications
- A branch and price algorithm for single-machine completion time variance
- Minimization of ordered, symmetric half-products
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- An almost exact solution to the min completion time variance in a single machine
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- A lower bound for weighted completion time variance
- Time-flexible min completion time variance in a single machine by quadratic programming
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Job scheduling methods for reducing waiting time variance
- On the Minimization of Completion Time Variance with a Bicriteria Extension
This page was built for publication: Fast fully polynomial approximation schemes for minimizing completion time variance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600838)
