A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem

Mohamed Abdel-Basset, Reda Mohamed, Mohamed Abouhawwash, Ripon K. Chakrabortty and Michael J. Ryan
Additional contact information
Mohamed Abdel-Basset: Department of Computer Science, Faculty of Computers and Informatics, Zagazig University, Zagazig 44519, Egypt
Reda Mohamed: Department of Computer Science, Faculty of Computers and Informatics, Zagazig University, Zagazig 44519, Egypt
Mohamed Abouhawwash: Department of Mathematics, Faculty of Science, Mansoura University, Mansoura 35516, Egypt
Ripon K. Chakrabortty: Capability Systems Centre, School of Engineering and IT, UNSW Canberra, Campbell, ACT 2612, Australia
Michael J. Ryan: Capability Systems Centre, School of Engineering and IT, UNSW Canberra, Campbell, ACT 2612, Australia

Mathematics, 2021, vol. 9, issue 3, 1-23

Abstract: In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm is based on the steps of the elitism continuous genetic algorithm improved by two strategies and used the largest rank value (LRV) rule to transform the continuous values into discrete ones for enabling of solving the combinatorial PFSSP. The first strategy is combining the arithmetic crossover with the uniform crossover to give the algorithm a high capability on exploitation in addition to reducing stuck into local minima. The second one is re-initializing an individual selected randomly from the population to increase the exploration for avoiding stuck into local minima. Afterward, those two strategies are combined with the proposed algorithm to produce an improved one known as the improved efficient genetic algorithm (IEGA). To increase the exploitation capability of the IEGA, it is hybridized a local search strategy in a version abbreviated as HIEGA. HIEGA and IEGA are validated on three common benchmarks and compared with a number of well-known robust evolutionary and meta-heuristic algorithms to check their efficacy. The experimental results show that HIEGA and IEGA are competitive with others for the datasets incorporated in the comparison, such as Carlier, Reeves, and Heller.

Keywords: combinatorial PFSSP; flow shop scheduling; largest rank value; makespan; meta-heuristic algorithms (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/3/270/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/3/270/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:3:p:270-:d:489351

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().