Minimizing busy time in multiple machine real-time scheduling (Q2908847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6073529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing busy time in multiple machine real-time scheduling |
scientific article; zbMATH DE number 6073529 |
Statements
29 August 2012
0 references
real-time scheduling
0 references
busy time
0 references
preemption
0 references
approximation algorithm
0 references
Minimizing busy time in multiple machine real-time scheduling (English)
0 references
0.9621805548667908
0 references
0.8690422773361206
0 references
0.8575612902641296
0 references
0.8533502221107483
0 references
0.839762270450592
0 references
