Scheduling results applicable to decision-theoretic troubleshooting
From MaRDI portal
(Redirected from Publication:473374)
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1754639 (Why is no real title available?)
- scientific article; zbMATH DE number 194946 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- A PTAS for minimizing the total weighted completion time on identical parallel machines.
- A survey of scheduling problems with setup times or costs
- Batch scheduling to minimize total completion time
- Batch sizing and job sequencing on a single machine
- Bayesian Networks and Decision Graphs
- Complexity of decision-theoretic troubleshooting
- Decision-theoretic troubleshooting: hardness of approximation
- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
- Faster integer multiplication
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests
- On Khot’s unique games conjecture
- On Schönhage's algorithm and subquadratic integer gcd computation
- On the Theory of Dynamic Programming
- On the approximability of single-machine scheduling with precedence constraints
- One-machine batching and sequencing of multiple-type items
- Optimal Long Code Test with One Free Bit
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Optimal strategies for a class of constrained sequential problems
- Optimal testing and repairing a failed series system
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Risk-sensitive decision-theoretic diagnosis
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling independent tasks to reduce mean finishing time
- Scheduling with batching: A review
- Scheduling with deadlines and loss functions
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Sequencing with Series-Parallel Precedence Constraints
- Sequential testing of complex systems: a review
- Single machine precedence constrained scheduling is a Vertex cover problem
- The SACSO methodology for troubleshooting complex systems
- The complexity of one-machine batching problems
- Troubleshooting: NP-hardness and solution methods
Cited in
(8)- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
- Batch repair actions for automated troubleshooting
- Troubleshooting: NP-hardness and solution methods
- Complexity of decision-theoretic troubleshooting
- Troubleshooting using probabilistic networks and value of information
- scientific article; zbMATH DE number 1844466 (Why is no real title available?)
- Decision-theoretic troubleshooting: hardness of approximation
- The SACSO methodology for troubleshooting complex systems
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)
