A SOLVABLE CASE OF THE VARIANCE MINIMIZATION PROBLEM

被引：6

作者：

CAI, X

机构：

[1] Department of Mathematics, The University of Western Australia, Nedlands

来源：

APPLIED MATHEMATICS LETTERS | 1993年 / 6卷 / 06期

关键词：

D O I：

10.1016/0893-9659(93)90086-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An algorithm is derived, which solves the completion time variance (CTV) problem with equal times in O(n log n) time. This result indicates that the special case formulated by and Muller [1] is well solvable.

引用

页码：97 / 100

页数：4

共 8 条

[1] SIMULTANEOUS MINIMIZATION OF MEAN AND VARIATION OF FLOW TIME AND WAITING TIME IN SINGLE-MACHINE SYSTEMS [J].

BAGCHI, U .

OPERATIONS RESEARCH, 1989, 37 (01) :118-125

[2]

CAI X, 1992, UNPUB MGMT SCI

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

EILON, S ;

CHOWDHURY, IG .

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

[4]

Hardy G., 1952, INEQUALITIES

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

MERTEN, AG ;

MULLER, ME .

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

[6]

MOSHEIOV G, 1990, THESIS COLUMBIA U NE

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

SCHRAGE, L .

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

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

VANI, V ;

RAGHAVACHARI, M .

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

← 1 →