The research aims to single out the maintenance actions to perform on a series arranged components system each one constituted by elements in parallel and maintained only during some planned stops. The considered system has to periodically carry out missions during which the system failure is a critical event for their own success. That being so, the faced problem is here to assure the maximum reliability level up to the next planned stop. For this reason an exact algorithm is proposed in order to individuate the set of components on which performing maintenance actions and for each of them determining the number of elements that must be maintained so as the maximum reliability level is achieved up to the end of the next mission with cost and time constraints
Certa, A., Galante, G.M., La Fata, C.M., Passannanti, G. (2010). Optimal Selection of Maintenance Actions on a Multi-Component System. In Proceedings of the 3rd International Conference on Advanced Manufacture ICAM 2010 (pp.538-542). Kenting : ICAM 2010 3rd International Conference on Advanced Manufacture.
Optimal Selection of Maintenance Actions on a Multi-Component System
CERTA, Antonella;GALANTE, Giacomo Maria;LA FATA, Concetta Manuela;PASSANNANTI, Gianfranco
2010-01-01
Abstract
The research aims to single out the maintenance actions to perform on a series arranged components system each one constituted by elements in parallel and maintained only during some planned stops. The considered system has to periodically carry out missions during which the system failure is a critical event for their own success. That being so, the faced problem is here to assure the maximum reliability level up to the next planned stop. For this reason an exact algorithm is proposed in order to individuate the set of components on which performing maintenance actions and for each of them determining the number of elements that must be maintained so as the maximum reliability level is achieved up to the end of the next mission with cost and time constraintsI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.