An analysis of the non-preemptive mixed-criticality match-up scheduling problem
type: Item
instance of: scholarly article
title: An analysis of the non-preemptive mixed-criticality match-up scheduling problem
zbMATH Open document ID: 1353.90061
author: Zdeněk Hanzálek
author: Tomáš Tunys
author: Přemysl Šůcha
published in: Journal of Scheduling
publication date: 2016-11-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6653506
zbMATH Keywords: uncertain processing times
zbMATH Keywords: scheduling
zbMATH Keywords: complexity
zbMATH Keywords: robustness
zbMATH Keywords: mixed-criticality
zbMATH Keywords: ILP
zbMATH Keywords: match-up
zbMATH Keywords: packing
MaRDI profile type: Publication
full work available at URL: s10951-016-0468-y
OpenAlex ID: W2299839370
cites work: Parallel machine match-up scheduling with manufacturing cost considerations
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Scheduling Real-Time Mixed-Criticality Jobs
cites work: A survey of scheduling with controllable processing times
cites work: Q3182207
cites work: Theory and Applications of Robust Optimization
cites work: Q2735585
cites work: A robust approach for the single machine scheduling problem
cites work: Robust Mixed-Criticality Systems
cites work: Online scheduling with preemption or non-completion penalties
cites work: Q4055377
cites work: A survey on offline scheduling with rejection
cites work: Metaheuristics for a scheduling problem with rejection and tardiness penalties
DOI: 10.1007/S10951-016-0468-Y
description: scientific article; zbMATH DE number 6653506