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...

Full description

Bibliographic Details
Main Authors: Levente Fazekas, Boldizsár Tüű-Szabó, László T. Kóczy, Olivér Hornyák, Károly Nehéz
Format: Article
Language:English
Published: MDPI AG 2023-08-01
Series:Algorithms
Subjects:
flow-shop
scheduling problem
discrete bacterial memetic evolutionary algorithm
hybrid DBMEA
Monte Carlo tree search
simulated annealing
Online Access:https://www.mdpi.com/1999-4893/16/9/406

Internet

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

Similar Items