Scheduling results applicable to decision-theoretic troubleshooting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F15%3A00431073" target="_blank" >RIV/67985556:_____/15:00431073 - isvavai.cz</a>
Alternative codes found
RIV/61384399:31160/15:00045420
Result on the web
<a href="http://dx.doi.org/10.1016/j.ijar.2014.08.004" target="_blank" >http://dx.doi.org/10.1016/j.ijar.2014.08.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ijar.2014.08.004" target="_blank" >10.1016/j.ijar.2014.08.004</a>
Alternative languages
Result language
angličtina
Original language name
Scheduling results applicable to decision-theoretic troubleshooting
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-20012S" target="_blank" >GA13-20012S: Conditional independence structures: algebraic and geometric methods</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Approximate Reasoning
ISSN
0888-613X
e-ISSN
—
Volume of the periodical
57
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
20
Pages from-to
87-107
UT code for WoS article
000347593900006
EID of the result in the Scopus database
—