Permutation flow shop scheduling problem under non-renewable resources constraints
by Imane Laribi; Farouk Yalaoui; Zaki Sari
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 9, No. 3, 2019

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.

Online publication date: Sat, 29-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email