IMPROVED LOWER BOUNDS FOR MINIMIZING THE SUM OF COMPLETION TIMES OF N-JOBS OVER M-MACHINES IN A FLOW-SHOP

被引：35

作者：

AHMADI, RH ^{[1
]}

BAGCHI, U ^{[1
]}

机构：

[1] UNIV TEXAS,DEPT MANAGEMENT,AUSTIN,TX 78712

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 44卷 / 03期

关键词：

flow shop; Production/scheduling;

D O I：

10.1016/0377-2217(90)90244-6

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The paper considers the classic n job, m machine scheduling problem where the objective is to minimize the sum of completion times. A procedure is presented for obtaining m - 1 new machine based lower bounds. The result is an improved overall lower bound. © 1990.

引用

页码：331 / 336

页数：6

共 7 条

[1] Baker K., 1974, INTRO SEQUENCING SCH
[2] Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160
[3] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION
GONZALEZ, T
SAHNI, S
[J]. OPERATIONS RESEARCH, 1978, 26 (01) : 36 - 52
[4] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS
IGNALL, E
SCHRAGE, L
[J]. OPERATIONS RESEARCH, 1965, 13 (03) : 400 - &
[5] EXACT, APPROXIMATE, AND GUARANTEED ACCURACY ALGORITHMS FOR FLOW-SHOP PROBLEM N-2-F-BARF
KOHLER, WH
STEIGLITZ, K
[J]. JOURNAL OF THE ACM, 1975, 22 (01) : 106 - 114
[6] HEURISTIC PROGRAMMING SOLUTION OF A FLOWSHOP-SCHEDULING PROBLEM
KRONE, MJ
STEIGLIT.K
[J]. OPERATIONS RESEARCH, 1974, 22 (03) : 629 - 638
[7] Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

← 1 →