0431073 20240103204541.020140912235959.9 84912034104 000347593900006 10.1016/j.ijar.2014.08.004 21 s. P cav_un_epca*02567740888-613X571 (2015)87-107Elsevier Decision-theoretic troubleshooting Single machine scheduling with weighted flowtime Algorithms Computational complexity 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 K Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0292670 GA13-20012S GA ČR In decision-theoretic troubleshooting, we are given a Bayesian network model of a malfunctioning device and our task is to find a repair strategy with minimal expected cost. The troubleshooting problem has received considerable attention over the past two decades. We show that several troubleshooting scenarios proposed in the literature are equivalent to well-studied machine scheduling problems. This immediately yields new complexity-theoretic and algorithmic results for troubleshooting. We also apply scheduling results to multi-agent troubleshooting. Further, we examine the so-called call service action which is often used in troubleshooting but has no natural counterpart in machine scheduling. We show that adding the call service action to basic troubleshooting models does not make the problem intractable. BB 2015 RVO:67985556 http://hdl.handle.net/11104/0236065 S COMPUTERSCIENCE.ARTIFICIALINTELLIGENCE 2.655 0.329 6.8 0.00574 0.855 2796 1.795 Q1 2.338 79 Q1 70.988 82.7 Q2 Q1* 82.692 2015 84912034104 SCOPUS 000347593900006 WOS cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 57 č. 1 2015 87 107 Elsevier