Minimizing the Flow-time Variance in Single-machine Systems

From MaRDI portal
Publication:5202822

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

C. R. Bector, Mahesh C. Gupta, Yash Pal 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




Related Items

A quadratic integer programming method for minimizing the mean squared deviation of completion timesCompletion time variance minimisation on two identical parallel processorsPseudopolynomial algorithms for CTV minimization in single machine schedulingOn discrete optimization with orderingMimimization of agreeably weighted variance in single machine systemsA lower bound for weighted completion time varianceMulti-machine scheduling with variance minimizationA branch and bound algorithm to minimize completion time variance on a single processor.Ordered weighted average optimization in multiobjective spanning tree problemSingle machine scheduling with coefficient of variation minimizationA hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functionsA branch and price algorithm for single-machine completion time varianceTabu search for a class of single-machine scheduling problemsHierarchical minimization of completion time variance and makespan in jobshopsCompletion time variance minimization in single machine and multi-machine systemsScheduling 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 varianceBounds for the position of the smallest job in completion time variance minimizationMinimizing flow time variance in a single machine system using genetic algorithms