An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6653506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analysis of the non-preemptive mixed-criticality match-up scheduling problem |
scientific article; zbMATH DE number 6653506 |
Statements
An analysis of the non-preemptive mixed-criticality match-up scheduling problem (English)
0 references
16 November 2016
0 references
uncertain processing times
0 references
scheduling
0 references
complexity
0 references
robustness
0 references
mixed-criticality
0 references
ILP
0 references
match-up
0 references
packing
0 references
0 references
0.8127416968345642
0 references
0.769315779209137
0 references
0.7647906541824341
0 references
0.7638450860977173
0 references
0.7629711627960205
0 references
