A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF |
scientific article; zbMATH DE number 7219886
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF |
scientific article; zbMATH DE number 7219886 |
Statements
A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (English)
0 references
13 July 2020
0 references
global EDF scheduler
0 references
tardiness
0 references
branch-and-bound
0 references
parallel algorithm
0 references
0 references
0.9069209
0 references
0.8677301
0 references
0.86132294
0 references
0.85875607
0 references
0.8586185
0 references
0.85283005
0 references
0.8509582
0 references
