A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors

• Published in: Journal of industrial and management optimization Vol. 10; no. 1; pp. 243 - 258
• Main Authors: Thi Hoai An, Le, Duc Quynh, Tran, Hloindo Adjallah, Kondo
• Format: Journal Article
• Language: English
• Published: Springfield American Institute of Mathematical Sciences 2014; AIMS
• Subjects: Algorithms; Computer Science; Convex analysis; Cost control; Integer programming; Preventive maintenance; Studies
• ISSN: 1553-166X; 1547-5816; 1553-166X
• DOI: 10.3934/jimo.2014.10.243

In this paper, we introduce a new approach based on DC (Difference of Convex functions) Programming and DCA (DC Algorithm) for minimizing the maintenance cost involving flow-time and tardiness penalties by optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. The main idea is to divide the horizon considered into H intervals. The problem is first formulated as a mixed integer linear problem (MILP) and then reformulated as a DC program. A solution method based on DCA is used to solve the resulting problem. The efficiency of DCA is compared with the algorithm based on the new flow-time and tardiness rule (FTR) given in [1]. The computational results on several test problems show that the solutions provided by DCA are better. [PUBLICATION ABSTRACT]