Robust job shop scheduling with machine unavailability due to random breakdowns and condition-based maintenance

Abstract

This paper presents a novel solution approach for a variant of the job shop scheduling problem with machine unavailability due to both condition-based preventive maintenance and corrective maintenance following random breakdowns. We first provide an exact mathematical formulation of the problem under simplifying assumptions, namely that the number of breakdowns for each job position on each machine is known, the degradation rates are fixed, and the preventive and corrective maintenance durations are deterministic parameters. Moreover, to handle the more realistic case of stochastic machine degradation, random breakdowns, and uncertain maintenance durations, a simulation-optimisation algorithm is proposed. The real makespan function is first approximated using multiple surrogate measures, which are optimised through independent genetic algorithms. Then, the fittest solutions obtained from these surrogate measures are simulated, and the best among them is added to an elite list, which is included in the genetic algorithms' populations for the next iteration. Schedule robustness is ensured by using an objective function that consists of the weighted average of the expected makespan and its 90th percentile. Furthermore, to reduce the likelihood of falling into a local optimum, a stopping criterion based on simulated annealing is implemented. Numerical experimentation on extended benchmark instances confirmed the validity of the mathematical formulation and the favourable performance of the proposed simulation-optimisation algorithm in terms of computational time and solution quality.