Scheduling results applicable to decision-theoretic troubleshooting (Q473374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2014.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965664334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine precedence constrained scheduling is a Vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Long Code Test with One Free Bit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theory of Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine batching and sequencing of multiple-type items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Networks and Decision Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SACSO methodology for troubleshooting complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal strategies for a class of constrained sequential problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal testing and repairing a failed series system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision-theoretic troubleshooting: hardness of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schönhage's algorithm and subquadratic integer gcd computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk-sensitive decision-theoretic diagnosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Khot’s unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of decision-theoretic troubleshooting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Troubleshooting: NP-hardness and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch sizing and job sequencing on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential testing of complex systems: a review / rank
 
Normal rank

Latest revision as of 08:44, 9 July 2024

scientific article
Language Label Description Also known as
English
Scheduling results applicable to decision-theoretic troubleshooting
scientific article

    Statements

    Scheduling results applicable to decision-theoretic troubleshooting (English)
    0 references
    0 references
    24 November 2014
    0 references
    0 references
    decision-theoretic troubleshooting
    0 references
    single-machine scheduling with weighted flowtime
    0 references
    algorithms
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references