A single machine scheduling problem with machine availability constraints and preventive maintenance

Considering the impact of machine availability is essential in production scheduling, especially when the target is to minimise total tardiness. In this study, a single machine scheduling problem derived from a rotor production workshop is addressed. We evaluate machine availability by its reliability, which can be restored by preventive maintenance (PM). PM with different improvement effectiveness is considered in the problem formulation. A genetic algorithm (GA) is developed to solve the problem. Emmons dominance rules are applied in the mutation processes of the GA. Computational experiments demonstrate the effectiveness and efficiency of the algorithm. Sensitivity analyses have been conducted to provide useful managerial insights for real workshop scheduling.

Automated summary

Considering machine availability is crucial in production scheduling, especially in minimizing total tardiness. This study addresses a single machine scheduling problem derived from a rotor production workshop, evaluating machine availability through reliability and incorporating preventive maintenance with different improvement effectiveness. A genetic algorithm with Emmons dominance rules in mutation processes is developed, demonstrating effectiveness and efficiency through computational experiments and providing managerial insights for real workshop scheduling through sensitivity analyses.