A Hybrid Discrete Bacterial Memetic Algorithm with Simulated Annealing for Optimization of the Flow Shop Scheduling Problem

A Hybrid Discrete Bacterial Memetic Algorithm with Simulated Annealing for Optimization of the Flow Shop Scheduling Problem

This paper deals with the flow shop scheduling problem. To find the optimal solution is an NP-hard problem. The paper reviews some algorithms from the literature and applies a benchmark dataset to evaluate their efficiency. In this research work, the discrete bacterial memetic evolutionary algorithm...

Full description

Bibliographic Details
Main Authors: Anita Agárdi, Károly Nehéz, Olivér Hornyák, László T. Kóczy
Format: Article
Language:English
Published: MDPI AG 2021-06-01
Series:Symmetry
Subjects:
discrete bacterial memetic evolutionary algorithm
simulated annealing
flow shop scheduling problem
Online Access:https://www.mdpi.com/2073-8994/13/7/1131

Internet

https://www.mdpi.com/2073-8994/13/7/1131

Similar Items