Proof of a conjecture of Schrage about the completion time variance problem

Authors:
Nicholas G. Hall;Wieslaw Kubiak
Affiliations:
Faculty of Management Sciences, The Ohio State University, Columbus, Ohio 43210-1399, USA;Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Newfoundland, Canada A1B 3X5
Venue:
Operations Research Letters
Year:
1991

Citing 1
Cited 8

Deterministic and random single machine sequencing with variance minimization

Operations Research

Job scheduling to minimize the weighted waiting time variance of jobs

Computers and Industrial Engineering
Job scheduling methods for reducing waiting time variance

Computers and Operations Research
Completion time variance minimization in single machine and multi-machine systems

Computers and Operations Research
Minimizing job completion time variance for service stability on identical parallel machines

Computers and Industrial Engineering
An efficient local search for minimizing completion time variance in permutation flow shops

Computers and Operations Research
Minimizing weighted waiting time variance on a single processor

Computers and Industrial Engineering
A quadratic integer programming method for minimizing the mean squared deviation of completion times

Operations Research Letters
Completion time variance minimization on a single machine is difficult

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of minimizing the completion time variance of n jobs on a single machine has been studied by several authors. We prove the correctness of a 1975 conjecture due to L. Schrage about the position of the third longest job in an optimal schedule.