An almost exact solution to the min completion time variance in a single machine
From MaRDI portal
(Redirected from Publication:2239979)
Recommendations
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
- Minimizing Single-Machine Completion Time Variance
- Completion time variance minimization in single machine and multi-machine systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- New results on the completion time variance minimization
Cites work
- A branch and bound algorithm to minimize completion time variance on a single processor.
- A convex envelope formula for multilinear functions
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- A lower bound for weighted completion time variance
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Asymptotically optimal appointment schedules
- Batch scheduling and common due-date assignment on a single machine
- Bounds for the position of the smallest job in completion time variance minimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- 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
- Minimising Waiting Time Variance in the Single Machine Problem
- 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 geometrical properties of preconditioners in IPMs for classes of block-angular problems
- On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Proof of a conjecture of Schrage about the completion time variance problem
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Tabu search for a class of single-machine scheduling problems
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(8)- A tight lower bound for the completion time variance problem
- A branch and bound algorithm to minimize completion time variance on a single processor.
- 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
- Minimising variance of job completion times in a single machine
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
- Time-flexible min completion time variance in a single machine by quadratic programming
- The minimization of the weighted completion time variance in a single machine: a specialized cutting-plane approach
This page was built for publication: An almost exact solution to the min completion time variance in a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239979)
