Deterministic and Random Single Machine Sequencing with Variance Minimization
From MaRDI portal
Publication:4726034
DOI10.1287/opre.35.1.111zbMath0616.90027OpenAlexW1973549312MaRDI QIDQ4726034
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.1.111
single machineheuristicexponential distribution of processing timesvariance interchange formulavariance of the jobs' completion times
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs, Scheduling with monotonous earliness and tardiness penalties, A quadratic integer programming method for minimizing the mean squared deviation of completion times, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Completion time variance minimisation on two identical parallel processors, Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Optimal sequences in stochastic single machine shops, Job scheduling methods for reducing waiting time variance, Mimimization of agreeably weighted variance in single machine systems, Multi-machine scheduling with variance minimization, Scheduling about a common due date with earliness and tardiness penalties, A branch and bound algorithm to minimize completion time variance on a single processor., Proof of a conjecture of Schrage about the completion time variance problem, Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times, Minimizing mean squared deviation of completion times with maximum tardiness constraint, Single machine scheduling with coefficient of variation minimization, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, On the general solution for a class of early/tardy problems, A branch and price algorithm for single-machine completion time variance, An efficient local search for minimizing completion time variance in permutation flow shops, Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences 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, Tabu search for a class of single-machine scheduling problems, Hierarchical minimization of completion time variance and makespan in jobshops, Completion time variance minimization in single machine and multi-machine systems, New results on the completion time variance minimization, Scheduling about a given common due date to minimize mean squared deviation of completion times, Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method, \(V\)-shape property for job sequences that minimize the expected completion time variance, A unified weight formula for calculating the sample variance from weighted successive differences, Bounds for the position of the smallest job in completion time variance minimization, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, Minimizing flow time variance in a single machine system using genetic algorithms, Completion time variance minimization on a single machine is difficult, Solution strategies for variance minimization problems, A solvable case of the variance minimization problem
