STOCHASTICALLY MINIMIZING THE MAKESPAN IN FLOW SHOPS

被引：15

|

作者：

FOLEY, RD

SURESH, S

机构：

来源：

NAVAL RESEARCH LOGISTICS | 1984年 / 31卷 / 04期

关键词：

D O I：

10.1002/nav.3800310405

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：551 / 557

页数：7

相关论文

共 50 条

[1] Stochastically minimizing the makespan in two-machine flow shops without blocking
Kamburowski, J
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (02) : 304 - 309
[2] MINIMIZING THE EXPECTED MAKESPAN IN STOCHASTIC FLOW SHOPS
PINEDO, M
[J]. OPERATIONS RESEARCH, 1982, 30 (01) : 148 - 162
[3] On the NEH heuristic for minimizing the makespan in permutation flow shops
Kalczynski, Pawel Jan
Kamburowski, Jerzy
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2007, 35 (01): : 53 - 60
[4] ON MINIMIZING THE EXPECTED MAKESPAN AND FLOW TIME IN STOCHASTIC FLOW SHOPS WITH BLOCKING
WIE, SH
PINEDO, M
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1986, 11 (02) : 336 - 342
[5] Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops
Brum, Artur
Ritt, Marcus
[J]. 2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 2403 - 2410
[6] A heuristic for minimizing the makespan in no-idle permutation flow shops
Kalczynski, PJ
Kamburowski, J
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 49 (01) : 146 - 154
[7] Minimizing makespan in a class of reentrant shops
Wang, MY
Sethi, SP
VandeVelde, SL
[J]. OPERATIONS RESEARCH, 1997, 45 (05) : 702 - 712
[8] Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J.
Ritt, Marcus
[J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 230 - 243
[9] Minimizing makespan in re-entrant permutation flow-shops
Pan, JCH
Chen, JS
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 642 - 653
[10] Minimizing makespan in three-machine flow shops with deteriorating jobs
Wang, Ji-Bo
Wang, Ming-Zheng
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (02) : 547 - 557

← 1 2 3 4 5 →