Proceedings of the 2015 International Conference on Recent Advances in Computer Systems

Comparison of two variants of particle swarm optimization algorithm for solving flexible job shop scheduling problem

Authors
S. Kamel, Souad Boubaker
Corresponding Author
S. Kamel
Available Online November 2015.
DOI
https://doi.org/10.2991/racs-15.2016.7How to use a DOI?
Keywords
particle swarm optimization; TRIBES; scheduling; makespan ; Computational intelligence
Abstract
The Scheduling is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization The Scheduling is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using nature-inspired meta-heuristics and intelligent algorithms. We present in this paper a solution to the flexible ob shop scheduling problem using two variants of particle swarm optimization namely parametric version (PSO) and fully- adaptive one (TRIBES). TRIBES like PSO, is a computational method that mimics the behavior of flying birds and their means of information exchange. The candidate solutions in the swarm communicate and cooperate with each other, whereas individuals in an evolutionary algorithm compete for survival. A study comparing the performances of both solutions is described and the results are analyzed. problem, and it has been solved with various methods using nature-inspired meta-heuristics and intelligent algorithms. We present in this paper a solution to the flexible ob shop scheduling
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
International Conference on Recent Advances in Computer Systems
Part of series
Advances in Computer Science Research
Publication Date
November 2015
ISBN
978-94-6252-146-9
ISSN
2352-538X
DOI
https://doi.org/10.2991/racs-15.2016.7How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - S. Kamel
AU  - Souad Boubaker
PY  - 2015/11
DA  - 2015/11
TI  - Comparison of two variants of particle swarm optimization algorithm for solving flexible job shop scheduling problem
BT  - International Conference on Recent Advances in Computer Systems
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/racs-15.2016.7
DO  - https://doi.org/10.2991/racs-15.2016.7
ID  - Kamel2015/11
ER  -