Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Soft Computing and Artificial Intelligence
Volume:2 Issue:2
Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem

Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem

Authors : Mohamed KURDI

Pages : 85-97

View : 18 | Download : 10

Publication Date : 2021-12-15

Article Type : Research Paper

Abstract :Permutation flow shop scheduling problem insert ignore into journalissuearticles values(PFSP); is an NP-complete problem with a wide range of applications in many real-world applications. Social spider optimization insert ignore into journalissuearticles values(SSO); is a swarm intelligence algorithm proposed for continuous optimization problems. Recently, SSO has received increased interest in the field of combinatorial optimization as well. For this reason, in this paper, SSO algorithm is proposed to solve the PFSP with make span minimization. The proposed algorithm has been tested on 141 well-known benchmark instances and compared against six other conventional and best-so-far metaheuristics. The obtained results show that SSO outperforms some of the compared works although they are hybrid methods.
Keywords : Metaheuristic, Optimization, Flow Shop Scheduling, Social Spider, swarm intelligence

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.