Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
From MaRDI portal
Publication:1754012
DOI10.1016/j.ejor.2017.03.054zbMath1403.90364OpenAlexW2599190760MaRDI QIDQ1754012
Yasmina Seddik, Zdeněk Hanzálek
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.054
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Scheduling with uncertain processing times in mixed-criticality systems ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules
Cites Work
- Unnamed Item
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Robust scheduling of wireless sensor networks for target tracking under uncertainty
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem
- A survey on offline scheduling with rejection
- A heuristic method for RCPSP with fuzzy activity times
- Match-up scheduling under a machine breakdown
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- Scheduling under fuzziness
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
- Sensitivity analysis for fixed-priority real-time systems
- Hard Real-Time Computing Systems
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- Theory and Applications of Robust Optimization
- Sequencing with Earliness and Tardiness Penalties: A Review
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Minimizing maximum lateness on one machine: computational experience and some applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust Scheduling of Task Graphs under Execution Time Uncertainty
- Sensitivity analysis for scheduling problems
- Scheduling
This page was built for publication: Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
