双目标流水线调度的动态双子群离散果蝇算法.pdfVIP

140 2017 ，53（12） Computer Engineering and Applications 计算机工程与应用 双目标流水线调度的动态双子群离散果蝇算法 1 1 2 1 潘玉霞 ，谢 光 ，桑红燕 ，张 晶 1 1 2 1 PAN Yuxia , XIE Guang , SANG Hongyan , ZHANG Jing 1. 三亚学院 信息与智能工程学院，海南 三亚 572000 2.聊城大学 计算机学院，山东 聊城 252000 1.College of Information and Intelligence Engineering, Sanya University, Sanya, Hainan 572000, China 2.School of Computer Science, Liaocheng University, Liaocheng, Shandong 252000, China PAN Yuxia, XIE Guang, SANG Hongyan, et al. Dynamic double subgroup fruit fly algorithm for bi-criteria flow shop scheduling problem. Computer Engineering and Applications, 2017, 53 （12）：140-146. Abstract ：This paper presents a fruit fly optimization algorithm （FOA ）based on dynamic double subgroup for solving the Bi-criteria No-wait Flowshop Scheduling Problem （BNFSP ）with makespan and idle time criteria. Unlike the traditional FOA, the proposed algorithm applies the job- permutation- based representation and initialization method based on the improved NEH （Nawaz-Enscore-Ham ）. Secondly, the whole group is dynamically divided into advanced subgroup and backward subgroup according to its own evolutionary level. A simple but effective insert search algorithm is made for advanced subgroup in the neighborhood, and iterative greedy is made for backward subgroup, so that the who group keeps in good balance between global exploration and local exploitation. Finally, to improve the efficiency of the scheduling algorithm, several speed-up methods are devised to evaluate a job permutation and its whole insert neighborhood as well as to decide the domination status of a solution with the archive set. Computational results show that the FOA presented in this paper is very effective and efficient for the BNFSP ． Key words ：fruit fly optimizatio