Deterministic and Random Single Machine Sequencing with Variance Minimization

DOI10.1287/OPRE.35.1.111MaRDI QIDQ4726034zbMATH OpenOpenAlexFDO

Authors Vina Vani, M. Raghavachari

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

zbMATH Keywords

heuristicsingle machineexponential distribution of processing timesvariance interchange formulavariance of the jobs' completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A single-machine scheduling problem with random processing times
• Minimization of expected variance of completion times on single machine for stochastic jobs
• V-shape property for job sequences that minimize the expected completion time variance
• Mimimization of agreeably weighted variance in single machine systems
• Single machine scheduling with coefficient of variation minimization

Cited in

(41)

• Single machine scheduling with coefficient of variation minimization
• A single-machine scheduling problem with random processing times
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Mimimization of agreeably weighted variance in single machine systems
• 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
• New results on the completion time variance minimization
• WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING
• Completion time variance minimization in single machine and multi-machine systems
• A solvable case of the variance minimization problem
• Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability
• Completion time variance minimisation on two identical parallel processors
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Minimizing mean squared deviation of completion times with maximum tardiness constraint
• 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
• Tabu search for a class of single-machine scheduling problems
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Optimal sequences in stochastic single machine shops
• V-shape property for job sequences that minimize the expected completion time variance
• Bounds for the position of the smallest job in completion time variance minimization
• A unified weight formula for calculating the sample variance from weighted successive differences
• Scheduling about a common due date with earliness and tardiness penalties
• Single machine scheduling problems with controllable processing times 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
• A quadratic integer programming method for minimizing the mean squared deviation of completion times
• Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Completion time variance minimization on a single machine is difficult
• The stochastic single machine scheduling problem with earliness and tardiness costs
• On the general solution for a class of early/tardy problems
• Job scheduling methods for reducing waiting time variance
• Solution strategies for variance minimization problems
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
• 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: Deterministic and Random Single Machine Sequencing with Variance Minimization

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