Minimizing the Flow-time Variance in Single-machine Systems

DOI10.1057/jors.1990.104zbMath0725.90039MaRDI QIDQ5202822

C. R. Bector, Yash Pal Gupta, Mahesh C. Gupta

Publication date: 1990

Published in: 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

single machine; heuristic; complementary pair-exchange principle; variance of job flow-times

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Tabu search for a class of single-machine scheduling problems, On discrete optimization with ordering, A lower bound for weighted completion time variance, Completion time variance minimization in single machine and multi-machine systems, Mimimization of agreeably weighted variance in single machine systems, Single machine scheduling with coefficient of variation 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, \(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, Minimizing flow time variance in a single machine system using genetic algorithms, A quadratic integer programming method for minimizing the mean squared deviation of completion times, Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Multi-machine scheduling with variance minimization, A branch and bound algorithm to minimize completion time variance on a single processor., Hierarchical minimization of completion time variance and makespan in jobshops