Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach
by Seyed Mojtaba Sajadi; Azar Alizadeh; Mostafa Zandieh; Fereshteh Tavan
International Journal of Mathematics in Operational Research (IJMOR), Vol. 14, No. 2, 2019

Abstract: In this paper, robust and stable scheduling for a flexible job-shop problem with random machine breakdowns has been discussed. A two-stage genetic algorithm is used to generate the predictive schedule. The first stage optimises the primary objective, which minimises the makespan, where all data is considered to be deterministic with no expected disruptions. The second stage optimises two objectives, makespan and stability, function in the presence of random machine breakdowns. For the second stage two different versions of multi-objective genetic algorithm, non-dominated sorting genetic algorithm II and non-dominated ranking genetic algorithm, is used. A simulator is proposed to simulate random machine breakdowns. An experimental study and analysis of variance is conducted to study the results of each multi-objective algorithm and breakdown simulator. The results of their comparison indicate that, non-dominated ranking genetic algorithm (NRGA) performs better and also shows a significant difference between various repair times in the proposed breakdown simulator.

Online publication date: Thu, 07-Feb-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 Mathematics in Operational Research (IJMOR):
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 subs@inderscience.com