H.A. Le Thi, D.Q. Tran, H.A. Kondo, A Difference of Convex functions Algorithm for Optimal Scheduling and real-time assignment of preventive maintenance jobs on parallel processors.

Abstract: 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 Hintervals. 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.

 

Keywords: DC programming, DCA, exact penalty, job-shop scheduling, flow-time, tardiness, release date.

 

Citation: Hoai An Le Thi, Duc Quynh Tran, Hloindo Adjallah Kondo, A Difference of Convex functions Algorithm for Optimal Scheduling and real-time assignment of preventive maintenance jobs on parallel processors. Journal of Industrial and Management Optimization, Volume 10, Issue 1, pp. 243-258, 2014.

 

Download link: http://www.aimsciences.org/article/doi/10.3934/jimo.2014.10.243