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

DOI10.1016/0167-6377(91)90024-JzbMath0751.90037WikidataQ123127412 ScholiaQ123127412MaRDI QIDQ1183389

Nicholas G. Hall, Wiesław X. Kubiak

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

one machine; completion time variance scheduling; Schrage's conjecture

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Job scheduling methods for reducing waiting time variance, Mimimization of agreeably weighted variance in single machine systems, Scheduling about a given common due date to minimize mean squared deviation of completion times, A tight lower bound for the completion time variance problem, Bounds for the position of the smallest job in completion time variance minimization, Completion time variance minimization on a single machine is difficult, 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., Fast fully polynomial approximation schemes for minimizing completion time variance

Cites Work

• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Variance Minimization in Single Machine Sequencing Problems