An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages  

作　　者：Zhenghui Yin Deming Lei Bo Yang 

机构地区：[1]School of Automation,Wuhan University of Technology,Wuhan 430070,China

出　　处：《Complex System Modeling and Simulation》2024年第3期292-302,共11页复杂系统建模与仿真（英文）

摘　　要：Hybrid flow shop scheduling problem(HFSP)has been extensively considered,however,some reallife conditions are seldom investigated.In this study,HFsP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm(ASFLA)is developed to optimize makespan.A new solution representation and a decoding procedure are presented,an adaptive memeplex search and dynamical population shuffling are implemented together.Many computational experiments are implemented.Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.

关 键 词：hybrid-flow shop scheduling shuffled frog-leaping algorithm precedence 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]