EQUIVALENCE OF MEAN FLOW TIME PROBLEMS AND MEAN ABSOLUTE DEVIATION PROBLEMS

被引：24

作者：

KUBIAK, W

LOU, S

SETHI, S

机构：

[1] Faculty of Management, University of Toronto, Toronto M5S IV4, Ont.

来源：

OPERATIONS RESEARCH LETTERS | 1990年 / 9卷 / 06期

基金：

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

关键词：

computational complexity; deterministic; parallel shop; production; scheduling;

D O I：

10.1016/0167-6377(90)90056-B

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The mean flow time problem and the mean absolute deviation problem for multiple uniform parallel machines are shown to be equivalent. For multiple unrelated parallel machines, a reduction of the mean absolute deviation problem into a transportation problem is presented. © 1990.

引用

页码：371 / 374

页数：4

共 11 条

[1] MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

BAGCHI, U ;

SULLIVAN, RS ;

CHANG, YL .

NAVAL RESEARCH LOGISTICS, 1986, 33 (02) :227-240

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

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

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

[3]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

[4]

EMMONS H, 1987, NAV RES LOG, V34, P803, DOI 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO

[5]

2-2

[6] ONE-PROCESSOR SCHEDULING WITH SYMMETRIC EARLINESS AND TARDINESS PENALTIES [J].

GAREY, MR ;

TARJAN, RE ;

WILFONG, GT .

MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :330-348

[7] SINGLE-PROCESSOR AND MULTIPLE-PROCESSOR MODELS FOR MINIMIZING COMPLETION-TIME VARIANCE [J].

HALL, NG .

NAVAL RESEARCH LOGISTICS, 1986, 33 (01) :49-54

[8] MINIMIZING THE AVERAGE DEVIATION OF JOB COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

KANET, JJ .

NAVAL RESEARCH LOGISTICS, 1981, 28 (04) :643-651

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

MCNAUGHTON, R .

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

[10]

Smith W., 1956, NAV RES LOGIST Q, V3, P59, DOI [https://doi.org/10.1002/nav.3800030106, DOI 10.1002/NAV.3800030106]

← 1 2 →