PROOF OF A CONJECTURE OF SCHRAGE ABOUT THE COMPLETION-TIME VARIANCE PROBLEM

被引：45

作者：

HALL, NG ^{[1
]}

KUBIAK, W ^{[1
]}

机构：

[1] MEM UNIV NEWFOUNDLAND,FAC BUSINESS ADM,ST JOHNS A1B 3X5,NEWFOUNDLAND,CANADA

来源：

OPERATIONS RESEARCH LETTERS | 1991年 / 10卷 / 08期

基金：

加拿大自然科学与工程研究理事会;

关键词：

SCHEDULING; COMPLETION TIME VARIANCE;

D O I：

10.1016/0167-6377(91)90024-J

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：467 / 472

页数：6

共 5 条

[1] MINIMIZING WAITING TIME VARIANCE IN SINGLE MACHINE PROBLEM [J].

EILON, S ;

CHOWDHURY, IG .

MANAGEMENT SCIENCE, 1977, 23 (06) :567-575

[2] MINIMIZING VARIATION OF FLOW TIME IN SINGLE-MACHINE SYSTEMS [J].

KANET, JJ .

MANAGEMENT SCIENCE, 1981, 27 (12) :1453-1459

[3] VARIANCE MINIMIZATION IN SINGLE MACHINE SEQUENCING PROBLEMS [J].

MERTEN, AG ;

MULLER, ME .

MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09) :518-528

[4] MINIMIZING TIME-IN-SYSTEM VARIANCE FOR A FINITE JOBSET [J].

SCHRAGE, L .

MANAGEMENT SCIENCE SERIES A-THEORY, 1975, 21 (05) :540-543

[5] DETERMINISTIC AND RANDOM SINGLE-MACHINE SEQUENCING WITH VARIANCE MINIMIZATION [J].

VANI, V ;

RAGHAVACHARI, M .

OPERATIONS RESEARCH, 1987, 35 (01) :111-120

← 1 →