Authors:
Mohamed Dhia Eddine Saouabi
1
;
Houssem Eddine Nouri
1
;
2
and
Olfa Belkahla Driss
1
;
3
Affiliations:
1
Univ. Manouba, ENSI, LARIA UR22ES01, Campus Universitaire Manouba, 2010, Tunisia
;
2
Univ. Gabes, ISGG, Rue Omar Ibn Khattab, 6029, Gabes, Tunisia
;
3
Univ. Manouba, ESCT, Campus Universitaire Manouba, 2010, Tunisia
Keyword(s):
Flexible Job Shop Scheduling Problem, Dynamic Scheduling, Genetic Algorithm, Bi-Level Optimization, Job insertion, Rescheduling.
Abstract:
The dynamic flexible job shop scheduling problem (DyFJSP) is an extension of the flexible job scheduling problem (FJSP) as the production environment is characterized by a set of disturbances that require a method capable of reacting in real time in order to generate an efficient schedule in case of production failure. In this paper, we propose a bi-level genetic algorithm (BLGA) to solve the DyFJSP in order to minimize the maximum completion time (Makespan). The dynamic scenario taken into account in this work is job insertion. To evaluate the performance of our approach, we carry out experiments on Brandimarte benchmark instances. The results of the experiments show that the BLGA is characterized by its efficiency and performance in comparison with other methods published in the literature.