Sequential testing of n-out-of-n systems: ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Sequential testing of n-out-of-n systems: Precedence theorems and exact methods
Auteur(s) :
Rostami, Salim [Auteur]
Creemers, Stefan [Auteur]
Lille économie management - UMR 9221 [LEM]
Wei, Wenchao [Auteur]
Leus, Roel [Auteur]
Catholic University of Leuven = Katholieke Universiteit Leuven [KU Leuven]
Creemers, Stefan [Auteur]
Lille économie management - UMR 9221 [LEM]
Wei, Wenchao [Auteur]
Leus, Roel [Auteur]
Catholic University of Leuven = Katholieke Universiteit Leuven [KU Leuven]
Titre de la revue :
European Journal of Operational Research
Pagination :
876-885
Éditeur :
Elsevier
Date de publication :
2019-05-01
ISSN :
0377-2217
Mot(s)-clé(s) en anglais :
Scheduling
System testing
Precedence theorems
Dynamic programming
Branch-and-price
System testing
Precedence theorems
Dynamic programming
Branch-and-price
Discipline(s) HAL :
Sciences de l'Homme et Société/Gestion et management
Résumé en anglais : [en]
The goal of sequential testing is to discover the state of a system by testing its components one by one. We consider n-out-of-n systems, which function only if all n components work. The testing continues until the system ...
Lire la suite >The goal of sequential testing is to discover the state of a system by testing its components one by one. We consider n-out-of-n systems, which function only if all n components work. The testing continues until the system state (up or down) is identified. The tests have known execution costs and failure probabilities, and are subject to precedence constraints. The objective is to find a sequence of tests that minimizes the total expected cost of the diagnosis. We show how to strengthen the precedence graph without losing all optimal solutions. We examine different formulations for the problem, and propose a dynamic-programming (DP) and a branch-and-price algorithm. Our computational results show that our DP noticeably outperforms the state of the art. Using a novel memory management technique, it significantly increases the size of the instances that can be solved to optimality within given limits on runtime and memory.Lire moins >
Lire la suite >The goal of sequential testing is to discover the state of a system by testing its components one by one. We consider n-out-of-n systems, which function only if all n components work. The testing continues until the system state (up or down) is identified. The tests have known execution costs and failure probabilities, and are subject to precedence constraints. The objective is to find a sequence of tests that minimizes the total expected cost of the diagnosis. We show how to strengthen the precedence graph without losing all optimal solutions. We examine different formulations for the problem, and propose a dynamic-programming (DP) and a branch-and-price algorithm. Our computational results show that our DP noticeably outperforms the state of the art. Using a novel memory management technique, it significantly increases the size of the instances that can be solved to optimality within given limits on runtime and memory.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :