Solving Flexible Job Shop Scheduling Problem using Hybrid Bilevel Optimization model

Informations générales

Année de publication

2018

Type

Chapitre de livre

Description

HIS 2018

Résumé

Flexible Job Shop Problem (FJSP) has an important significance in both fields of production management and combinatorial optimization. This problem is decomposed into two sub-problems: the assignment problem and the scheduling problem. Following this structure, we consider in this work the FJSP as a bilevel problem. For that, we are interested to solve this problem with bilevel optimization method in which the upper level optimizes the assignment problem and the lower level optimizes the scheduling problem. Therefore, we propose, for the first time, an hybrid bilevel optimization model named HB-FJSP based on both exact and approximate methods to solve the FJSP in order to minimize the makespan. The computational results confirm that our model HB-FJSP provides better solutions than other models.

BibTeX
Ben Younes, H., Azzouz, A., Ennigrou, M. (2020). Solving Flexible Job Shop Scheduling Problem Using Hybrid Bilevel Optimization Model. In: Madureira, A., Abraham, A., Gandhi, N., Varela, M. (eds) Hybrid Intelligent Systems. HIS 2018. Advances in Intelligent Systems and Computing, vol 923. Springer, Cham.

Auteurs