Fast Evolutionary Algorithm for Flow Shop Scheduling Problems

Fast Evolutionary Algorithm for Flow Shop Scheduling Problems

Being complex and combinatorial optimization problems, Permutation Flow Shop Scheduling Problems (PFSSP) are difficult to be solved optimally. PFSSP occurs in many manufacturing systems i.e. automobile industry, glass industry, paper industry, appliances industry, and pharmaceutical industry, and th...

Full description

Bibliographic Details
Main Authors: Bilal Khurshid, Shahid Maqsood, Muhammad Omair, Biswajit Sarkar, Muhammad Saad, Uzair Asad
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Permutation flow shop scheduling
evolution strategy
Carlier problem
makespan
Reeves problem
Online Access:https://ieeexplore.ieee.org/document/9380322/

Internet

https://ieeexplore.ieee.org/document/9380322/

Similar Items