Scheduling results applicable to decision-theoretic troubleshooting
type: Item
instance of: scholarly article
title: Scheduling results applicable to decision-theoretic troubleshooting
zbMATH Open document ID: 1388.90055
author: Václav Lín
published in: International Journal of Approximate Reasoning
publication date: 2014-11-24T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 6372140
zbMATH Keywords: decision-theoretic troubleshooting
zbMATH Keywords: single-machine scheduling with weighted flowtime
zbMATH Keywords: algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ijar.2014.08.004
OpenAlex ID: W1965664334
cites work: The complexity of one-machine batching problems
cites work: A survey of scheduling problems with setup times or costs
cites work: Single machine precedence constrained scheduling is a Vertex cover problem
cites work: On the approximability of single-machine scheduling with precedence constraints
cites work: Optimal Long Code Test with One Free Bit
cites work: On the Theory of Dynamic Programming
cites work: Q4826104
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4535067
cites work: One-machine batching and sequencing of multiple-type items
cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time
cites work: Q3549597
cites work: Q4198056
cites work: Batch scheduling to minimize total completion time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Bayesian Networks and Decision Graphs
cites work: The SACSO methodology for troubleshooting complex systems
cites work: Optimal strategies for a class of constrained sequential problems
cites work: Q4369384
cites work: Optimal testing and repairing a failed series system
cites work: Q4692914
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
cites work: Decision-theoretic troubleshooting: hardness of approximation
cites work: Scheduling with deadlines and loss functions
cites work: Q4918387
cites work: On Schönhage's algorithm and subquadratic integer gcd computation
cites work: Sequencing with Series-Parallel Precedence Constraints
cites work: Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
cites work: Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests
cites work: Scheduling with batching: A review
cites work: Risk-sensitive decision-theoretic diagnosis
cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
cites work: A PTAS for minimizing the total weighted completion time on identical parallel machines.
cites work: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
cites work: On Khot’s unique games conjecture
cites work: Complexity of decision-theoretic troubleshooting
cites work: Troubleshooting: NP-hardness and solution methods
cites work: Batch sizing and job sequencing on a single machine
cites work: Sequential testing of complex systems: a review
DOI: 10.1016/J.IJAR.2014.08.004
description: scientific article; zbMATH DE number 6372140