文献类型：期刊文献

英文题名：Improved shuffled frog leaping algorithm for permutation flow shop scheduling

作者：Xu, Zhenhao[1]; Xu, Xiao[1]; Gu, Xingsheng[1]

机构：[1] Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai, China

年份：2014

卷号：58 VOL I

起止页码：267

外文期刊名：WIT Transactions on Information and Communication Technologies

收录：EI(收录号：20142717889748)

语种：英文

外文关键词：Machine shop practice

摘要：This paper studies the scheduling problem in a permutation flow shop with the objective of makespan, which is known as one of major problems in the field of scheduling. In order to solving the corresponding model, an improved shuffled frog leaping algorithm (ISFLA) is put forward for this kind of scheduling problem. A new leaping rule based on the characteristic of the problem is devised to improve the performance of the ISFLA. And it can not only produce feasible solutions but also maintain the structure characteristic of the SFLA. Computational experiments on benchmark sets show that the proposed ISFLA is greatly effective to generate good solutions relative to the other two algorithms. ? 2014 WIT Press.