Minimising Waiting Time Variance in the Single Machine Problem

Cited in

(64)

Minimizing completion time variance with compressible processing times
Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
Single machine stochastic JIT scheduling problem subject to machine breakdowns
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from 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
A V-shape property of optimal schedule of jobs about a common due date
Tabu search for a class of single-machine scheduling problems
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
Scheduling problems with random processing times under expected earliness/tardiness costs
Processing-plus-wait due dates in single-machine scheduling
Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
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
Minimizing weighted mean absolute deviation of job completion times from their weighted mean
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 unified weight formula for calculating the sample variance from weighted successive differences
Survey of scheduling research involving due date determination decisions
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.
Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
Completion time variance minimization in single machine and multi-machine systems
Design of predictable production scheduling model using control theoretic approach
\(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
Another well-solvable case of the QAP: maximizing the job completion time variance
A solvable case of the variance minimization problem
The symmetric quadratic knapsack problem: approximation and scheduling applications
Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
Pseudopolynomial algorithms for CTV minimization in single machine scheduling
New results on the completion time variance minimization
A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
Heuristic methods and applications: A categorized survey
\(V\)-shape property for job sequences that minimize the expected completion time variance
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
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Fast fully polynomial approximation schemes for minimizing completion time variance
Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
Time-flexible min completion time variance in a single machine by quadratic programming
Minimizing mean squared deviation of completion times with maximum tardiness constraint
Hierarchical minimization of completion time variance and makespan in jobshops
Sequencing heuristic for bicriteria scheduling in a single machine problem
A single-machine deteriorating job scheduling problem with a non-regular criterion
The multiple checkpoint ordering problem

This page was built for publication: Minimising Waiting Time Variance in the Single Machine Problem

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