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