WORST-CASE ANALYSIS OF AN APPROXIMATION ALGORITHM FOR FLOWSHOP SCHEDULING

被引：24

|

作者：

NOWICKI, E

SMUTNICKI, C

机构：

来源：

OPERATIONS RESEARCH LETTERS | 1989年 / 8卷 / 03期

关键词：

D O I：

10.1016/0167-6377(89)90045-X

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：171 / 177

页数：7

相关论文

共 50 条

[1] WORST-CASE ANALYSIS OF DANNENBRING ALGORITHM FOR FLOWSHOP SCHEDULING
NOWICKI, E
SMUTNICKI, C
[J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (08) : 473 - 480
[2] NEW RESULTS IN THE WORST-CASE ANALYSIS FOR FLOWSHOP SCHEDULING
NOWICKI, E
SMUTNICKI, C
[J]. DISCRETE APPLIED MATHEMATICS, 1993, 46 (01) : 21 - 41
[3] WORST-CASE ANALYSIS OF A SCHEDULING ALGORITHM
SPINRAD, J
[J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (01) : 9 - 11
[4] Worst-Case Analysis of an Approximation Algorithm for Single Machine Scheduling Problem
Grigoreva, Natalia
[J]. PROCEEDINGS OF THE 2021 16TH CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENCE SYSTEMS (FEDCSIS), 2021, : 221 - 225
[5] A NOTE ON WORST-CASE ANALYSIS OF APPROXIMATION ALGORITHMS FOR A SCHEDULING PROBLEM
NOWICKI, E
SMUTNICKI, C
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 74 (01) : 128 - 134
[6] The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Chang, SY
Hwang, HC
[J]. DISCRETE APPLIED MATHEMATICS, 1999, 92 (2-3) : 135 - 147
[7] ON THE WORST-CASE RATIO OF A COMPOUND MULTIPROCESSOR SCHEDULING ALGORITHM
KUNDE, M
STEPPAT, H
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (06) : 389 - 396
[8] Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
Oliver Braun
Fan Chung
Ron Graham
[J]. OR Spectrum, 2016, 38 : 531 - 540
[9] Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
Braun, Oliver
Chung, Fan
Graham, Ron
[J]. OR SPECTRUM, 2016, 38 (02) : 531 - 540
[10] Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
Kuo, Wen-Hung
Hsu, Chou-Jung
Yang, Dar-Li
[J]. INFORMATION SCIENCES, 2012, 184 (01) : 282 - 297

← 1 2 3 4 5 →