A heuristic algorithm for mean flowtime objective in flowshop scheduling

被引：92

作者：

Woo, HS ^{[1
]}

Yim, DS

机构：

[1] Syst Engn Res Inst, Taejon 305333, South Korea

[2] Hannam Univ, Dept Ind Engn, Taejon 300791, South Korea

来源：

COMPUTERS & OPERATIONS RESEARCH | 1998年 / 25卷 / 03期

关键词：

D O I：

10.1016/S0305-0548(97)00050-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Based on a job insertion method, a heuristic algorithm is developed to reduce the mean flowtime in a permutation flowshop environment. Simulation experiments are performed to evaluate effectiveness of the proposed algorithm against the existing heuristic methods. The simulation results show that the proposed algorithm generates more accurate solutions than other heuristics, especially when ratio of the number of jobs and the number of machines is greater than or equal to two. (C) 1998 published by Elsevier Science Ltd. All rights reserved.

引用

页码：175 / 182

页数：8

共 24 条

[11] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].