An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers

被引：0
|
作者：
Sang, Hong-yan [1 ]
Pan, Quan-ke [2 ,3 ]
机构：
[1] Liaocheng Univ, Sch Math Sci, Liaocheng 252059, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Peoples R China
[3] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Peoples R China
来源：
2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC) | 2013年
关键词：
Flow shop with intermediate buffers; Makespan; Discrete invasive weed optimization; Local search; MACHINE; DESIGN;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The flow shop scheduling problem with intermediate bffers has important applications in modern industry. This paper addresses this problem with the objective of minimizing the makespan and presents an effective discrete IWO (DIWO) algorithm. In the proposed DIWO, a Nawaz-Enscore-Ham heuristic is used to generate an initial solution with a certain level of quality. An improved IWO-search mechanism is utilized to evolve in the global space. An efficient local search algorithm is embedded in the algorithm to enhance exploitation. Computational experiments demonstrate the effectiveness of the proposed DIWO algorithm for solving the problem.
引用
收藏
页码：861 / 864
页数：4
相关论文
共 50 条
12345