A lower bound for weighted completion time variance
From MaRDI portal
Recommendations
- Minimizing Single-Machine Completion Time Variance
- Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
- Mimimization of agreeably weighted variance in single machine systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- New results on the completion time variance minimization
Cites work
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
- V-shape property for job sequences that minimize the expected completion time variance
- A branch and bound algorithm to minimize completion time variance on a single processor.
- A half-product based approximation scheme for agreeably weighted completion time variance
- Batch scheduling and common due-date assignment on a single machine
- Bounds for the position of the smallest job in completion time variance minimization
- Completion time variance minimization on a single machine is difficult
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Job scheduling methods for reducing waiting time variance
- Mimimization of agreeably weighted variance in single machine systems
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimization of half-products
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing the Flow-time Variance in Single-machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimizing Variation of Flow Time in Single Machine Systems
- 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
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- Tabu search for a class of single-machine scheduling problems
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(12)- A tight lower bound for the completion time variance problem
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Minimizing the weighted sum of completion times under processing time uncertainty
- The single machine weighted mean squared deviation problem
- A branch and price algorithm for single-machine completion time variance
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- An almost exact solution to the min completion time variance in a single machine
- Mean completion time for a randomly varying rate of work
- Minimizing Single-Machine Completion Time Variance
- Time-flexible min completion time variance in a single machine by quadratic programming
- A half-product based approximation scheme for agreeably weighted completion time variance
- The minimization of the weighted completion time variance in a single machine: a specialized cutting-plane approach
This page was built for publication: A lower bound for weighted completion time variance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613431)
