A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems

A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems

Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional cases, there are no explicit algorithms for find...

全面介紹

書目詳細資料
Main Authors: Levente Fazekas, Boldizsár Tüű-Szabó, László T. Kóczy, Olivér Hornyák, Károly Nehéz
格式: Article
語言:English
出版: MDPI AG 2023-08-01
叢編:Algorithms
主題:
flow-shop
scheduling problem
discrete bacterial memetic evolutionary algorithm
hybrid DBMEA
Monte Carlo tree search
simulated annealing
在線閱讀:https://www.mdpi.com/1999-4893/16/9/406

因特網

https://www.mdpi.com/1999-4893/16/9/406

相似書籍