MétaCan
Menu
Retour à la cohorte
Enregistrement W7132919224

Systems subject to repair and maintenance actions: Modeling and optimization

2008· dissertation· W7132919224 sur OpenAlexfundno aff
Diederik Lugtigheid

Notice bibliographique

RevueTSpace · 2008
Typedissertation
Langue
DomaineEngineering
ThématiqueReliability and Maintenance Optimization
Établissements canadiensnon disponible
Organismes subventionnairesNatural Sciences and Engineering Research Council of CanadaUniversity of TorontoOntario Centres of Excellence
Mots-clésContext (archaeology)OutsourcingTime horizonDecision modelDecision support systemOptimal decisionDecision problemOptimization problem
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

In maintenance and reliability, the use of systems that are repairable is growing every year, as consumers and manufacturers are gradually moving away from "throw-away" products for economical and environmental reasons. In contrast to non-repairable systems for which the only decision to be made is the "when to replace" decision, for repairable systems the decisions to be made are more complex. Not only needs the "when to replace" decision be addressed, but in addition also the "when to repair" and "what to repair" decisions. This makes the optimization of repairable systems complex. Furthermore, the formulation of repairable systems optimization problems is influenced by the business context that surrounds the system under consideration. Therefore, at least in theory, numerous repairable system optimization models can be formulated, where each is defined by the system itself and the business context it belongs to. The first model, called the General Repair Restriction Model (GRRM), addresses the question when to replace or repair a repairable system over a finite horizon when the number of repairs to which the system can be subjected to is restricted. Also, the system owner does not have information on the detailed repair activities that are being carried out, and/or cannot control the "what to repair" decision due to the outsourcing of system repairs to specialized repair centres. A dynamic programming approach will be used to derive the structure of the optimal policies. The second model, called the Repair and Maintenance Indicator Model (RMI), addresses the same question when the system owner does have access to detailed repair information and can control the "what to repair" decision. The RMI model is a new repairable system model, and is aimed to accommodate a greater variety of repairable systems. Besides the capability to address the "what to repair" question, the RMI model can also identify the most critical parts of a system, which may be of particular importance to OEMs (Original Equipment Manufacturers) when prioritizing design modifications aimed to improve system reliability. The general purpose of the RMI model (in contrast to models previously published in the literature) is to establish a clear decision rule in terms of the parts to be replaced in each repair, and therefore goes beyond the traditional "age-reduction" or "intensity-reduction" factors which have been frequently used to specify the "degree of repair" whenever the system is in the repair shop. This will be of particular benefit for tradepersons in the repair shop, as the RMI model will establish not only the "degree of repair" but also how to accomplish this "degree" in more practical terms. Besides the theoretical results, for both models several examples and case studies will be presented. The case studies are based on real problems commonly encountered in industry. The case studies show that both models are realistic, with considerable practical applications. In this thesis, two repairable system optimization models will be addressed. These two models are based on two commonly found business contexts in industry (in particular the mining industry), but have not been addressed so far in the maintenance and reliability literature.

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 enseignants

Ni 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.

score de la tête « metaresearch » (Codex)0,000
score de la tête « metaresearch » (Gemma)0,001
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesMéta-épidémiologie (sens strict)
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Simulation ou modélisation · Signal consensuel: Simulation ou modélisation
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,751
Score d'incertitude au seuil1,000

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0000,001
Méta-épidémiologie (sens strict)0,0010,001
Méta-épidémiologie (sens large)0,0010,000
Bibliométrie0,0000,001
Études des sciences et des technologies0,0000,000
Communication savante0,0000,000
Science ouverte0,0000,000
Intégrité de la recherche0,0010,000
Charge utile insuffisante (le modèle a refusé de juger)0,0000,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.

Tête enseignante Opus0,018
Tête enseignante GPT0,272
Écart entre enseignants0,254 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_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écoule

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Devis d'étudeSimulation ou modélisation
Domainenon disponible
GenreEmpirique

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 ».

En bref

Citations0
Publié2008
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revueTSpaceMême sujetReliability and Maintenance OptimizationTravaux en français237 207