Skip to Main content Skip to Navigation
Conference papers

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem

Abstract : Flexible job-shop scheduling problem (FJSP) is very important in many research fields such as production management and combinatorial optimization. The FJSP problems cover two difficulties namely machine assignment problem and operation sequencing problem. In this paper, we apply particle swarm optimization (PSO) algorithm to solve this FJSP problem aiming to minimize the maximum completion time criterion. Various benchmark data taken from literature, varying from Partiel FJSP and Total FJSP, are tested. Computational results proved that the PSO developed is enough effective and efficient to solve flexible job-shop scheduling problem.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03450910
Contributor : Frédéric Pruvost Connect in order to contact the contributor
Submitted on : Friday, November 26, 2021 - 11:24:24 AM
Last modification on : Thursday, December 9, 2021 - 5:16:49 PM

Identifiers

  • HAL Id : hal-03450910, version 1

Collections

Citation

Maroua Nouiri, Abderezak Jemai, Ahmed Chiheb Ammari, Abdelghani Bekrar, Smail Niar. An effective particle swarm optimization algorithm for flexible job-shop scheduling problem. IEEE International Conference on Industrial Engineering and Systems Management IESM’13, Institute of Electrical and Electronics Engineers (IEEE), Oct 2013, Rabat, Morocco. pp.29-34. ⟨hal-03450910⟩

Share

Metrics

Les métriques sont temporairement indisponibles