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 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.
Type de document :
Article dans une revue
Journal of Industrial and Management Optimization, AIMS, 2014, 〈10.3934/jimo.2014.10.243〉
Liste complète des métadonnées

https://hal.univ-lorraine.fr/hal-01387300
Contributeur : Lcoms Ul <>
Soumis le : mardi 25 octobre 2016 - 13:42:42
Dernière modification le : vendredi 4 mai 2018 - 01:26:26

Lien texte intégral

Identifiants

Collections

Citation

Hoai An Le Thi, Quynh Tran Duc, Kondo-Hloindo Adjallah. 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, AIMS, 2014, 〈10.3934/jimo.2014.10.243〉. 〈hal-01387300〉

Partager

Métriques

Consultations de la notice

91