An analysis of the non-preemptive mixed-criticality match-up scheduling problem

DOI10.1007/s10951-016-0468-yzbMath1353.90061OpenAlexW2299839370MaRDI QIDQ341470

Zdeněk Hanzálek, Tomáš Tunys, Přemysl Šucha

Publication date: 16 November 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0468-y

zbMATH Keywords

complexityrobustnessschedulingpackingILPmixed-criticalitymatch-upuncertain processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

The triangle scheduling problem ⋮ Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution ⋮ Scheduling with uncertain processing times in mixed-criticality systems ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules

Cites Work

• A survey on offline scheduling with rejection
• Online scheduling with preemption or non-completion penalties
• A robust approach for the single machine scheduling problem
• Parallel machine match-up scheduling with manufacturing cost considerations
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• A survey of scheduling with controllable processing times
• Theory and Applications of Robust Optimization
• Robust Mixed-Criticality Systems
• Scheduling Real-Time Mixed-Criticality Jobs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analysis of the non-preemptive mixed-criticality match-up scheduling problem