0476547 20240903170637.020170728235959.9 85026509110 000407667400007 10.14736/kyb-2017-3-0493 20 s. P cav_un_epca*02971630023-5954533 (2017)493-512Ústav teorie informace a automatizace AV ČR, v. v. i. binary integer programming decision-theoretic troubleshooting cav_un_auth*0272969 Matematická teorie rozhodování Department of Decision Making Theory MTR MTR Department of Decision Making Theory 100 Lín Václav UTIA-B CZ Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2017/MTR/lin-0476547.pdf cav_un_auth*0292670 GA13-20012S GA ČR We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for the problem. This can be used to solve the problem directly or to compute lower bounds of the minimal expected cost using linear programming relaxation. We also present three greedy algorithms for computing initial feasible solutions. JD 10000 10200 10201 2018 1 RVO:67985556 http://hdl.handle.net/11104/0273533 1 S 3+4 Article Computer Science Cybernetics 3+4 Article Computer Science Cybernetics 3+4 Article Computer Science Cybernetics COMPUTERSCIENCE.CYBERNETICS 0.596 0.048 12.4 0.00096 0.224 808 0.321 0.513 63 Q4 18.907 11.4 Q4 Q3 0.2 Q4 11.364 2017 85026509110 SCOPUS PUBMED 000407667400007 WOS cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 53 č. 3 2017 493 512 Ústav teorie informace a automatizace AV ČR, v. v. i.