An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers
作者单位：School of Mathematics Science Liaocheng University State Key Laboratory of Synthetical Automation for Process Industries Northeastern University College of Computer Science Liaocheng University
会议名称：《第25届中国控制与决策会议》
主办单位：IEEE;NE Univ;IEEE Ind Elect Chapter;IEEE Harbin Sect Control Syst Soc Chapter;Guizhou Univ;IEEE Control Syst Soc;Syst Engn Soc China;Chinese Assoc Artificial Intelligence;Chinese Assoc Automat;Tech Comm Control Theory;Chinese Assoc Aeronaut;Automat Control Soc;Chinese Assoc Syst Simulat;Simulat Methods & Modeling Soc;Intelligent Control & Management Soc
会议日期：2013年
学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学]
基 金：supported by National Nature Science Foundation under Grant 61174187 Basic scientific research foundation of Northeast University (No. N110208001) starting foundation of Northeast University (No. 29321006)
关 键 词：Flow shop with intermediate buffers Makespan Discrete invasive weed optimization Local search
摘 要：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.