Rejoinder to: “An overview of some classical and discussion of the signature‐based models of preventive maintenance”
Notice bibliographique
Résumé
First, we express our sincere thanks to all the discussants for their constructive, interesting points, and promising comments.Receiving 11 discussions on the paper itself shows that the topic of optimal preventive maintenance of technical systems is one of the most interesting topics in reliability engineering due to its wide applications in practice.The discussants have provided very important comments on the paper, proposing new lines of future research on the signature-based maintenance of complex systems.In the sequel, we present our responses to the discussions to the main comments of the discussants.Extending the application of signatures to maintenance techniques other than age-based maintenance, such as condition-based maintenance and predictive maintenance, has been proposed in discussions by Zhang and Liu, Castro, Alfonso Surez-Llorens and Chahkandi.Because of the importance of condition-based maintenance in reliability engineering, this direction of research would of course be of great interest.We should mention that signature-based maintenance discussed in our review paper relies on the assumption that the lifetimes of the components of the system have a common continuous distribution.As long as the signature-based representation of system reliability is met (see the discussion by Spizzichino in this regard), then a condition-based maintenance approach may be scheduled based on various concepts of signature.Of course, associated mathematical computations may be complicated and tedious.As we have already mentioned in the paper, Hashemi and Asadi (2020) have proposed a type of condition-based maintenance for a coherent system equipped with a warning light that counts the number of failed components in the system.In the proposed strategy, the type of repair depends both on the age of the system and the number of failed components (see also Hashemi et al. (2020) and the references in the discussion by Castro for other condition-based maintenance policies of a system with different types of components using the notions of signature and survival signature).Zhang and Liu have commented on the efficient computation of signatures.Although assessing the signature of coherent systems has been discussed in the literature, the topic still needs to be investigated further to develop efficient algorithms for listing signature vectors of coherent systems of different orders.Navarro and Rubio 1 already provided a list of signatures of coherent systems with five components.A Monte-Carlo simulation approach has been discussed by Gertsbakh and Shpungin 2 to estimate the signature of systems (networks).Aslett 3 has developed a package called 'ReliabilityTheory' in R to evaluate the signature and survival signature of a coherent system.Here, we would like to state that future works should focus on explicitly quantifying the time complexity of the whole maintenance optimization procedure based on signatures.Castro has raised an interesting point, which is important from a practical point of view.She has mentioned the possibility of exploring how signature-based techniques can be employed in finite time horizon maintenance problems.We believe that this will certainly be an interesting line of research.She has also suggested that using a signature approach, different optimality criteria (other than renewal techniques) can be compared concerning computational time involved in the calculation of the signature vector.As we stated above, these important issues could be directions for further investigation in the future.Coolen et al. have made a detailed discussion on possible problems for survival signature-based approaches in maintenance strategies, in particular when the replacement of components is involved (see also Zhang and Liu for the same
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».