Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem
Permutation flow-shop scheduling is the strategy that ensures the processing of jobs on each subsequent machine in the exact same order while optimizing an objective, which generally is the minimization of makespan. Because of its NP-Complete nature, a substantial portion of the literature has mainl...
Main Authors: | Iqbal Hayat, Adnan Tariq, Waseem Shahzad, Manzar Masud, Shahzad Ahmed, Muhammad Umair Ali, Amad Zafar |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-04-01
|
Series: | Systems |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-8954/11/5/221 |
Similar Items
-
Synthesis of New Reconfigurable Limited Size FSS Structures Using an Improved Hybrid Particle Swarm Optimization
by: Patric Lacouth, et al. -
A particle swarm optimization approach for permutation flow shop scheduling problem
by: Radha Ramanan T., et al.
Published: (2014-01-01) -
SC: A NOVEL FUZZY CRITERION FOR SOLVING ENGINEERING AND CONSTRAINED OPTIMIZATION PROBLEMS
by: Sergio G. De los Cobos Silva, et al.
Published: (2017-04-01) -
An Overview of Variants and Advancements of PSO Algorithm
by: Meetu Jain, et al.
Published: (2022-08-01) -
Competitive Coevolution-Based Improved Phasor Particle Swarm Optimization Algorithm for Solving Continuous Problems
by: Omer Ali, et al.
Published: (2023-10-01)