This paper deals with a flow shop scheduling problem in which machines are not available during the whole planning horizon and the periods of unavailability are due to random faults. Since they are subject to failures, both corrective maintenance activities and scheduled maintenance activities are performed to increase their availability. Hence, jobs and maintenance tasks are jointly considered to find the optimal schedule. The objective is to find the optimal integrated job-planned maintenance sequence that minimises the makespan and the earliness-tardiness penalty. To this aim, we propose two novel meta-heuristic algorithms obtained modifying a standard Genetic Algorithm (GA) and Harmony Search (HS). Numerical results obtained from experiments considering different problem sizes and configurations show that the proposed Harmony Search and Genetic Algorithm are efficient to approach the integrated job-maintenance scheduling problem.
Metaheuristics for the flow shop scheduling problem with maintenance activities integrated / Branda, Antonella; Castellano, Davide; Guizzi, Guido; Popolo, Valentina. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 151:(2021), p. 106989. [10.1016/j.cie.2020.106989]
Metaheuristics for the flow shop scheduling problem with maintenance activities integrated
Davide Castellano;
2021
Abstract
This paper deals with a flow shop scheduling problem in which machines are not available during the whole planning horizon and the periods of unavailability are due to random faults. Since they are subject to failures, both corrective maintenance activities and scheduled maintenance activities are performed to increase their availability. Hence, jobs and maintenance tasks are jointly considered to find the optimal schedule. The objective is to find the optimal integrated job-planned maintenance sequence that minimises the makespan and the earliness-tardiness penalty. To this aim, we propose two novel meta-heuristic algorithms obtained modifying a standard Genetic Algorithm (GA) and Harmony Search (HS). Numerical results obtained from experiments considering different problem sizes and configurations show that the proposed Harmony Search and Genetic Algorithm are efficient to approach the integrated job-maintenance scheduling problem.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S0360835220306598-main (2).pdf
Accesso riservato
Dimensione
1.8 MB
Formato
Adobe PDF
|
1.8 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris