An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling

An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling

Due to the NP-hard nature, the permutation flowshop scheduling problem (PFSSP) is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm (IGSFLA) to solve the permutati...

Full description

Saved in:
Bibliographic Details
Main Authors: Peiliang Wu, Qingyu Yang, Wenbai Chen, Bingyi Mao, Hongnian Yu
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2020/3450180
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items