DCA for Minimizing the Cost and Tardiness of Preventive Maintenance Tasks under Real-Time Allocation Constraint

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. The main idea is to divide the horizon considered into H intervals and the problem is first formulated as a mixed integer linear problem (MILP). It is afterward reformulated in the form of a DC program by an exact penalty technique. Solution method based on DCA is investigated 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 [8]. The computational results on several test problems show that the solutions provided by DCA are better.
Type de document :
Chapitre d'ouvrage
Ngoc Thanh Nguyen and Manh Thanh Le and Jerzy Swiatek. Intelligent Information and Database Systems Second International Conference, ACIIDS Proceedings part II, 5991, Springer, pp.410-419, 2010, Lecture Notes in Computer Science, 978-3-642-12100-5. 〈10.1007/978-3-642-12101-2_42〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00601072
Contributeur : Ist Inria Nancy Grand Est <>
Soumis le : jeudi 16 juin 2011 - 15:47:26
Dernière modification le : mercredi 25 avril 2018 - 17:03:06

Identifiants

Collections

Citation

Tran Duc Quynh, Le Thi Hoai An, Kondo-Hloindo Adjallah. DCA for Minimizing the Cost and Tardiness of Preventive Maintenance Tasks under Real-Time Allocation Constraint. Ngoc Thanh Nguyen and Manh Thanh Le and Jerzy Swiatek. Intelligent Information and Database Systems Second International Conference, ACIIDS Proceedings part II, 5991, Springer, pp.410-419, 2010, Lecture Notes in Computer Science, 978-3-642-12100-5. 〈10.1007/978-3-642-12101-2_42〉. 〈inria-00601072〉

Partager

Métriques

Consultations de la notice

251