A lower bound for weighted completion time variance
From MaRDI portal
Publication:613431
DOI10.1016/j.ejor.2010.05.050zbMath1206.90046DBLPjournals/eor/NessahC10OpenAlexW2163984453WikidataQ57185706 ScholiaQ57185706MaRDI QIDQ613431
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.050
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ 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
Cites Work
- A half-product based approximation scheme for agreeably weighted completion time variance
- Job scheduling methods for reducing waiting time variance
- Mimimization of agreeably weighted variance in single machine systems
- Proof of a conjecture of Schrage about the completion time variance problem
- \(V\)-shape property for job sequences that minimize the expected completion time variance
- Bounds for the position of the smallest job in completion time variance minimization
- Completion time variance minimization on a single machine is difficult
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
- A branch and bound algorithm to minimize completion time variance on a single processor.
- Fast fully polynomial approximation schemes for minimizing completion time variance
- New results on the completion time variance minimization
- Batch scheduling and common due-date assignment on a single machine
- Minimization of Half-Products
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Variation of Flow Time in Single Machine Systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Minimizing the Flow-time Variance in Single-machine Systems
- Variance Minimization in Single Machine Sequencing Problems
- Tabu search for a class of single-machine scheduling problems
This page was built for publication: A lower bound for weighted completion time variance
