Integrating flexible-interval preventive maintenance planning with production scheduling

• Published in: International journal of computer integrated manufacturing Vol. 22; no. 12; pp. 1089 - 1101
• Main Authors: Jin, Yu-Lan, Jiang, Zu-Hua, Hou, Wen-Rui
• Format: Journal Article
• Language: English
• Published: Routledge 01.01.2009
• Subjects: Completion time; flexible interval; genetic algorithm; optimisation; Optimization; Policies; Preventive maintenance; Production scheduling; Repair; Scheduling; Searching
• ISSN: 0951-192X; 1362-3052
• DOI: 10.1080/09511920903207449

Preventive maintenance (PM) planning and production scheduling are very important problems in the manufacturing industry. In this paper, the authors address production scheduling and PM planning for a single machine. A set of jobs that must be processed in sequence on the machine, which is subject to minimal repair upon failure as well as preventive maintenance (preventive replacement). PM actions are performed under flexible intervals. The authors suppose that the jobs can be resumed without any penalty after either minimal repair or PM actions. The purpose of the scheduling problem is to choose an optimal sequence for the jobs as well as an optimal PM planning which minimise the total weighted expected completion time of the jobs. Genetic algorithm is used to search for the optimal flexible-interval PM planning and job scheduling. The performance of the proposed policy was compared with other policies addressing the same problem of production scheduling and PM planning.