Scheduling results applicable to decision-theoretic troubleshooting

DOI10.1016/J.IJAR.2014.08.004zbMATH Open1388.90055OpenAlexW1965664334MaRDI QIDQ473374FDOQ473374

Authors: Václav Lín 

Publication date: 24 November 2014

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2014.08.004

Recommendations

• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Complexity of decision-theoretic troubleshooting
• Decision-theoretic troubleshooting: hardness of approximation
• Troubleshooting: NP-hardness and solution methods
• Troubleshooting using probabilistic networks and value of information

zbMATH Keywords

algorithmscomputational complexitydecision-theoretic troubleshootingsingle-machine scheduling with weighted flowtime

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• Title not available (Why is that?)
• Scheduling with batching: A review
• On the approximability of single-machine scheduling with precedence constraints
• Bayesian Networks and Decision Graphs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• On the Theory of Dynamic Programming
• A survey of scheduling problems with setup times or costs
• Scheduling with deadlines and loss functions
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling independent tasks to reduce mean finishing time
• The complexity of one-machine batching problems
• Batch sizing and job sequencing on a single machine
• Faster integer multiplication
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Batch scheduling to minimize total completion time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Schönhage's algorithm and subquadratic integer gcd computation
• A PTAS for minimizing the total weighted completion time on identical parallel machines.
• Sequential testing of complex systems: a review
• Sequencing with Series-Parallel Precedence Constraints
• Single machine precedence constrained scheduling is a Vertex cover problem
• Optimal strategies for a class of constrained sequential problems
• One-machine batching and sequencing of multiple-type items
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Troubleshooting: NP-hardness and solution methods
• Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests
• Optimal testing and repairing a failed series system
• Decision-theoretic troubleshooting: hardness of approximation
• The SACSO methodology for troubleshooting complex systems
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• On Khot’s unique games conjecture
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Complexity of decision-theoretic troubleshooting
• Risk-sensitive decision-theoretic diagnosis
• Title not available (Why is that?)
• Optimal Long Code Test with One Free Bit

Cited In (8)

• Decision-theoretic troubleshooting: hardness of approximation
• Batch repair actions for automated troubleshooting
• Title not available (Why is that?)
• The SACSO methodology for troubleshooting complex systems
• Complexity of decision-theoretic troubleshooting
• Troubleshooting using probabilistic networks and value of information
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Troubleshooting: NP-hardness and solution methods

This page was built for publication: Scheduling results applicable to decision-theoretic troubleshooting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473374)