Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints

DOI10.1007/978-3-642-22152-1_18zbMath1341.90033OpenAlexW1748917837MaRDI QIDQ3011946

Václav Lín

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_18

zbMATH Keywords

computational complexityschedulingdynamic programmingdecision-theoretic troubleshooting

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Decision-theoretic troubleshooting: hardness of approximation, Scheduling results applicable to decision-theoretic troubleshooting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of one-machine batching problems
• Troubleshooting: NP-hardness and solution methods
• The SACSO methodology for troubleshooting complex systems
• The Recognition of Series Parallel Digraphs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Complexity of decision-theoretic troubleshooting