DCA for minimizing the cost and tardiness of preventive maintenance tasks under real-time allocation constraint

Authors:
Tran Duc Quynh;Le Thi Hoai An;Kondo Hloindo Adjallah
Affiliations:
Laboratory of Theoretical and Applied Computer Science, University of Paul Verlaine, Metz, France;Laboratory of Theoretical and Applied Computer Science, University of Paul Verlaine, Metz, France;LGIPM, INRIA Costeam, Ecole National d'Ingénieurs de Metz, France
Venue:
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Year:
2010

Citing 3
Cited 0

A tabu search heuristic for preventive maintenance scheduling

Computers and Industrial Engineering
A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem

SIAM Journal on Optimization
A continuous approach for the concave cost supply problem via DC programming and DCA

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.