A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440): Difference between revisions
From MaRDI portal
Latest revision as of 03:26, 10 December 2024
scientific article
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 |
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