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

Autor:	Zhenghui Yin, Deming Lei, Bo Yang
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	hybrid-flow shop scheduling shuffled frog-leaping algorithm precedence Electronic computers. Computer science QA75.5-76.95 Systems engineering TA168
Zdroj:	Complex System Modeling and Simulation, Vol 4, Iss 3, Pp 292-302 (2024)
Druh dokumentu:	article
ISSN:	2096-9929 2097-3705
DOI:	10.23919/CSMS.2024.0014
Popis:	Hybrid flow shop scheduling problem (HFSP) has been extensively considered, however, some real-life 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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/6a2be2e433db48ef93b1d43249ed22a6 Zobrazit plný text záznamu View record in DOAJ