Incorporating periodic preventive maintenance into flexible flowshop scheduling problems
One of the most thoroughly studied scheduling assumptions is considering that machines may not be periodically available during the production scheduling. Although many researchers have made great attempts at integrating production and preventive maintenance scheduling by different methods, some of these methods are so intricate that one cannot independently code them to achieve the same effectiveness, or some strongly utilize specific features of the original considered problem that one cannot extend to other problems. This paper intends to apply integrating methods simple, yet easily extendible to any other machine scheduling problems. The paper investigates scheduling flexible flowshops subject to periodic preventive maintenance on machines. The objective is to minimize makespan. Two metaheuristics, including genetic algorithm and artificial immune system, and some constructive heuristics are developed to tackle the problem. The performance of the algorithms is evaluated by comparing their solutions. The results of the computational experiments indicate that the artificial immune system outperforms the other methods.
periodic preventive maintenance flexible flowshops scheduling genetic algorithm constructive heuristic artificial immune algorithm