Minimizing the Time-in-System Variance for a Finite Jobset

Cited In (39)

Single machine scheduling with coefficient of variation minimization
A single-machine deteriorating job scheduling problem with a non-regular criterion
A tight lower bound for the completion time variance problem
Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
Mimimization of agreeably weighted variance in single machine systems
Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
A branch and price algorithm for single-machine completion time variance
Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
New results on the completion time variance minimization
Fast fully polynomial approximation schemes for minimizing completion time variance
Completion time variance minimization in single machine and multi-machine systems
Another well-solvable case of the QAP: maximizing the job completion time variance
A solvable case of the variance minimization problem
An almost exact solution to the min completion time variance in a single machine
Completion time variance minimisation on two identical parallel processors
A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
A lower bound for weighted completion time variance
Minimizing flow time variance in a single machine system using genetic algorithms
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
Scheduling about a given common due date to minimize mean squared deviation of completion times
Multi-machine scheduling with variance minimization
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Tabu search for a class of single-machine scheduling problems
Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
Bounds for the position of the smallest job in completion time variance minimization
Time-flexible min completion time variance in a single machine by quadratic programming
Scheduling about a common due date with earliness and tardiness penalties
Single machine scheduling problems with controllable processing times and total absolute differences penalties
A quadratic integer programming method for minimizing the mean squared deviation of completion times
Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
Completion time variance minimization on a single machine is difficult
The stochastic single machine scheduling problem with earliness and tardiness costs
A branch and bound procedure to minimize mean absolute lateness on a single processor
On the general solution for a class of early/tardy problems
Job scheduling methods for reducing waiting time variance
Proof of a conjecture of Schrage about the completion time variance problem
An efficient local search for minimizing completion time variance in permutation flow shops
Scheduling with monotonous earliness and tardiness penalties
A branch and bound algorithm to minimize completion time variance on a single processor.

This page was built for publication: Minimizing the Time-in-System Variance for a Finite Jobset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4058801)