A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11241-018-9319-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2898240133 / rank | |||
Normal rank | |||
Revision as of 22:18, 19 March 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
