HAL CCSD
Permutation flow shop scheduling problem under non-renewable resources constraints
Laribi, Imane
Yalaoui, Farouk
Sari, Zaki
Manufacturing engineering laboratory of Tlemcen (MELT) ; Université Aboubekr Belkaid - University of Belkaïd Abou Bekr [Tlemcen]
Laboratoire d'Optimisation des Systèmes Industriels (LOSI) ; Institut Charles Delaunay (ICD) ; Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)
International audience
ISSN: 2040-3607
International Journal of Mathematical Modelling and Numerical Optimisation
Inderscience
hal-02502522
https://utt.hal.science/hal-02502522
https://utt.hal.science/hal-02502522
International Journal of Mathematical Modelling and Numerical Optimisation, 2019, 9 (3), pp.254. ⟨10.1504/IJMMNO.2019.100494⟩
DOI: 10.1504/IJMMNO.2019.100494
info:eu-repo/semantics/altIdentifier/doi/10.1504/IJMMNO.2019.100494
en
scheduling
non-renewable resources
optimisation
mathematical programming
genetic algorithm
local search
permutation flow shop
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
info:eu-repo/semantics/article
Journal articles
The majority of flow shop scheduling problems considers machines as the only resource. However, in most real-life manufacturing environments, jobs for their processing on machines may require additional non-renewable resources. Considering such resources, the scheduling problem is more realistic and much harder to solve. In this paper, we investigate the permutation flow shop scheduling problem subject to non-renewable resources constraints. The objective is to find a schedule that minimises the maximum completion time. An integer linear programming model is developed. Because of the computation time constraint, we propose an approximate resolution method based on genetic algorithm. To obtain better and more robust solutions, the Taguchi method is performed for tuning the parameters and operators of the algorithm. Furthermore, a local search is proposed to enhance the searching ability. Finally, computational experiments are conducted to evaluate the performance of both mathematical model and algorithm on different configurations of non-renewable resources availability.
2019