摘要

In this paper, we introduce a new approach based on DC (Difference of Convex %26apos;fun(tions).1-)rogramming and.DCA (DC Algorithm) for minimizing the maintenance cost involving flow lime 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 PI intervals. The problem is first formulated as a mixed integer linear problem (MIT. P) and then reformulated as a.DC program. A solution method based on DCA is used to solve the resulting problem. The efficiency of DC1A is compared with the algorithm based on the new flow time and tardiness rule (FTR) given in 11 l%26apos;he computational results on several test problems show that the solutions provided by DCA are better.

  • 出版日期2014-1