Computing the execution probability of jobs with replication in mixed-criticality schedules

DOI10.1007/s10479-021-04445-xzbMath1480.90138OpenAlexW4205154313MaRDI QIDQ2069250

Publication date: 20 January 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04445-x

zbMATH Keywords

computational complexity Bayesian networks scheduling mixed-criticality job replication uncertain processing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

Unnamed Item
An analysis of the non-preemptive mixed-criticality match-up scheduling problem
Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources
The complexity of computing the permanent
An optimal approximation algorithm for Bayesian inference
A branch-and-bound procedure for the robust cyclic job shop problem
Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Project scheduling under uncertainty: survey and research potentials
Distributionally robust scheduling on parallel machines under moment uncertainty
Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
Modeling single machine preemptive scheduling problems for computational efficiency
Scheduling with uncertain processing times in mixed-criticality systems
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Towards an Architecture-Independent Analysis of Parallel Algorithms
The Complexity of Enumeration and Reliability Problems
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Robust Mixed-Criticality Systems
Handbook on Scheduling

This page was built for publication: Computing the execution probability of jobs with replication in mixed-criticality schedules