A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440): Difference between revisions
From MaRDI portal
Normalize DOI. |
Created claim: Wikidata QID (P12): Q129024134, #quickstatements; #temporary_batch_1733739904112 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129024134 / rank | |||
Normal rank | |||
Revision as of 11:27, 9 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
