| bibtype |
J -
Journal Article
|
| ARLID |
0431073 |
| utime |
20240103204541.0 |
| mtime |
20140912235959.9 |
| SCOPUS |
84912034104 |
| WOS |
000347593900006 |
| DOI |
10.1016/j.ijar.2014.08.004 |
| title
(primary) (eng) |
Scheduling results applicable to decision-theoretic troubleshooting |
| specification |
| page_count |
21 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0256774 |
| ISSN |
0888-613X |
| title
|
International Journal of Approximate Reasoning |
| volume_id |
57 |
| volume |
1 (2015) |
| page_num |
87-107 |
| publisher |
|
|
| keyword |
Decision-theoretic troubleshooting |
| keyword |
Single machine scheduling with weighted flowtime |
| keyword |
Algorithms |
| keyword |
Computational complexity |
| author
(primary) |
| ARLID |
cav_un_auth*0272969 |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| full_dept |
Department of Decision Making Theory |
| share |
100 |
| name1 |
Lín |
| name2 |
Václav |
| institution |
UTIA-B |
| garant |
K |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0292670 |
| project_id |
GA13-20012S |
| agency |
GA ČR |
|
| abstract
(eng) |
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. |
| RIV |
BB |
| reportyear |
2015 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0236065 |
| confidential |
S |
| mrcbT16-e |
COMPUTERSCIENCEARTIFICIALINTELLIGENCE |
| mrcbT16-j |
0.855 |
| mrcbT16-s |
1.795 |
| mrcbT16-4 |
Q1 |
| mrcbT16-B |
70.988 |
| mrcbT16-C |
82.692 |
| mrcbT16-D |
Q2 |
| mrcbT16-E |
Q1 |
| arlyear |
2015 |
| mrcbU14 |
84912034104 SCOPUS |
| mrcbU34 |
000347593900006 WOS |
| mrcbU63 |
cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 57 č. 1 2015 87 107 Elsevier |
|