SCHEDULE OF N-JOBS ON 2 IDENTICAL MACHINES TO MINIMIZE WEIGHTED MEAN FLOW TIME

被引：6

作者：

ALIDAEE, B

机构：

[1] Mathematics and Physical Sciences Department, West Texas State University, Canyon

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1993年 / 24卷 / 01期

关键词：

D O I：

10.1016/0360-8352(93)90023-Q

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this note we consider the problem of scheduling n jobs on two identical processors to minimize weighted flow time (WMFT). Similarities between this problem and weighted earliness and tardiness (WET) on a single machine [6] is discussed. Based on results on recent developments on WET problem, we give a dynamic programming algorithm for the WMFT problem on two identical processors.

引用

收藏

页码：53 / 55

页数：3

相关论文

共 11 条

[1] SCHEDULING WITH PARALLEL PROCESSORS AND LINEAR DELAY COSTS [J].

BAKER, KR ;

MERTEN, AG .

NAVAL RESEARCH LOGISTICS, 1973, 20 (04) :793-804

[2]

BAKER KR, 1990, OPER RES, V38, P93

[3] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387

[4] SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].

CHENG, TCE ;

GUPTA, MC .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166

[5] BOUNDS FOR THE OPTIMAL SCHEDULING OF NORMAL-JOBS ON META-PROCESSORS [J].

EASTMAN, WL ;

EVEN, S ;

ISAACS, IM .

MANAGEMENT SCIENCE, 1964, 11 (02) :268-279

[6]

HALL N, IN PRESS OPNS RES

[7] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[8] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].

MCNAUGHTON, R .

MANAGEMENT SCIENCE, 1959, 6 (01) :1-12

[9]

Rothkopf M. H., 1966, MANAGE SCI, V12, P437, DOI [DOI 10.1287/MNSC.12.5.437, 10.1287/mnsc.12.5.437]

[10] ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS [J].

SAHNI, SK .

JOURNAL OF THE ACM, 1976, 23 (01) :116-127