Minimizing the Flow-time Variance in Single-machine Systems

DOI10.1057/JORS.1990.104MaRDI QIDQ5202822zbMATH OpenOpenAlexFDO

Authors C. R. Bector, Mahesh C. Gupta, Yash P. Gupta

Publication date 1990

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1990.104

zbMATH Keywords

heuristicsingle machinecomplementary pair-exchange principlevariance of job flow-times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing flow time variance in a single machine system using genetic algorithms
• Minimizing Single-Machine Completion Time Variance
• Multi-machine scheduling with variance minimization
• Completion time variance minimization in single machine and multi-machine systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension

Cited in

(23)

• Single machine scheduling with coefficient of variation minimization
• Mimimization of agreeably weighted variance in single machine systems
• Hierarchical minimization of completion time variance and makespan in jobshops
• A branch and price algorithm for single-machine completion time variance
• Ordered weighted average optimization in multiobjective spanning tree problem
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
• Completion time variance minimization in single machine and multi-machine systems
• 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
• 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
• 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 quadratic integer programming method for minimizing the mean squared deviation of completion times
• Minimising variance of job completion times in a single machine
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• On discrete optimization with ordering
• Job scheduling methods for reducing waiting time variance
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• A branch and bound algorithm to minimize completion time variance on a single processor.

This page was built for publication: Minimizing the Flow-time Variance in Single-machine Systems

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