Metaheuristics for the flow shop scheduling problem with maintenance activities integrated

•The paper focuses on a flow shop scheduling problem with maintenance activities integrated.•The machines are subjected to failures with a Weibull distributed time-to-failure.•The optimum number of planned maintenance tasks is evaluated.•Metaheuristics based on the Harmony Search algorithm and Genetic Algorithm are compared.•The new algorithms developed are highly effective. 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.