A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11241-018-9319-6 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129024134 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11241-018-9319-6 / rank | |||
Normal rank | |||
Latest revision as of 04: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
