Olfa Belkahla Driss

Olfa Belkahla Driss

Auto-generated profile, based on publicly available information

Olfa Belkahla Driss

Higher School of Commerce of Tunis ESCT, University of Manouba, Manouba, Tunisia

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
HBHafewa Bargaoui
Hafewa Bargaoui
ODOlfa Belkahla Driss
Olfa Belkahla Driss
KGKhaled Ghédira
Khaled Ghédira

1 December 2016 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
HNHoussem Eddine Nouri
Houssem Eddine Nouri
ODOlfa Belkahla Driss
Olfa Belkahla Driss
KGKhaled Ghédira
Khaled Ghédira

1 July 2019 in Government Information Quarterly
Verified
Journal Article
Closed access
ODOlfa Belkahla Driss
Olfa Belkahla Driss
SMSehl Mellouli
Sehl Mellouli
ZTZeineb Trabelsi
Zeineb Trabelsi

16 May 2017 in Journal of Industrial Engineering International
Verified
Journal Article
Open access
PDF file
HNHoussem Eddine Nouri
Houssem Eddine Nouri
ODOlfa Belkahla Driss
Olfa Belkahla Driss
KGKhaled Ghédira
Khaled Ghédira
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

10 October 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
TMTasnim Mraihi
Tasnim Mraihi
ODOlfa Belkahla Driss
Olfa Belkahla Driss
Hind BRILHind BRIL
Hind BRIL

1 January 2018 in Procedia Computer Science
Verified
Journal Article
Open access
MDMondher Dhiflaoui
Mondher Dhiflaoui
HNHoussem Eddine Nouri
Houssem Eddine Nouri
ODOlfa Belkahla Driss
Olfa Belkahla Driss