Permutation flow shop scheduling problem under non-renewable resources constraints. (29th April 2019)

• Record Type: Journal Article
• Authors: Laribi, Imane; Yalaoui, Farouk; Sari, Zaki
• Is Part Of: International journal of mathematical modelling and numerical optimisation. Volume 9:Number 3(2019)
• Page Start: 254
• Page End: 286
• Publication Date: 2019-04-29
• Subjects: scheduling -- non-renewable resources -- optimisation -- mathematical programming -- genetic algorithm -- local search -- permutation flow shop; Mathematical models -- Periodicals; Mathematical optimization -- Periodicals; 519.605
• Languages: English
• ISSNs: 2040-3607

Abstract

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.