Completion time variance minimization in single machine and multi-machine systems
From MaRDI portal
Recommendations
- Minimizing flow time variance in a single machine system using genetic algorithms
- Minimizing Single-Machine Completion Time Variance
- Multi-machine scheduling with variance minimization
- Completion time variance minimisation on two identical parallel processors
- Minimizing the Flow-time Variance in Single-machine Systems
Cites work
- A branch and bound algorithm to minimize completion time variance on a single processor.
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability
- Bounds for the position of the smallest job in completion time variance minimization
- Completion time variance minimization on a single machine is difficult
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Genetic algorithms and traveling salesman problems
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing flow time variance in a single machine system using genetic algorithms
- Minimizing the Flow-time Variance in Single-machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- Multi-machine scheduling with 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
- Tabu search for a class of single-machine scheduling problems
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(12)- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Hierarchical minimization of completion time variance and makespan in jobshops
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- A branch and price algorithm for single-machine completion time variance
- An almost exact solution to the min completion time variance in a single machine
- Completion time variance minimisation on two identical parallel processors
- Minimizing flow time variance in a single machine system using genetic algorithms
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- Minimising variance of job completion times in a single machine
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
This page was built for publication: Completion time variance minimization in single machine and multi-machine systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733521)
