An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:39, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of the non-preemptive mixed-criticality match-up scheduling problem |
scientific article |
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
