Scheduling results applicable to decision-theoretic troubleshooting
From MaRDI portal
Publication:473374
DOI10.1016/j.ijar.2014.08.004zbMath1388.90055OpenAlexW1965664334MaRDI QIDQ473374
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
algorithmscomputational complexitydecision-theoretic troubleshootingsingle-machine scheduling with weighted flowtime
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- Single machine precedence constrained scheduling is a Vertex cover problem
- Optimal strategies for a class of constrained sequential problems
- The complexity of one-machine batching 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
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Sequential testing of complex systems: a review
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Optimal testing and repairing a failed series system
- Decision-theoretic troubleshooting: hardness of approximation
- A survey of scheduling problems with setup times or costs
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
- The SACSO methodology for troubleshooting complex systems
- Scheduling with Deadlines and Loss Functions
- On the Approximability of Single-Machine Scheduling with Precedence Constraints
- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
- On Khot’s unique games conjecture
- Bayesian Networks and Decision Graphs
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- Sequencing with Series-Parallel Precedence Constraints
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Complexity of decision-theoretic troubleshooting
- Risk-sensitive decision-theoretic diagnosis
- Scheduling independent tasks to reduce mean finishing time
- Optimal Long Code Test with One Free Bit
- On Schönhage's algorithm and subquadratic integer gcd computation
- On the Theory of Dynamic Programming
