Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Identical coupled task scheduling: polynomial complexity of the cyclic case |
scientific article; zbMATH DE number 6534375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identical coupled task scheduling: polynomial complexity of the cyclic case |
scientific article; zbMATH DE number 6534375 |
Statements
Identical coupled task scheduling: polynomial complexity of the cyclic case (English)
0 references
22 January 2016
0 references
high-multiplicity
0 references
polynomial complexity
0 references
coupled task
0 references
cyclic scheduling
0 references
0 references
0.8602369427680969
0 references
0.8598382472991943
0 references
0.857275128364563
0 references
0.8532475233078003
0 references
0.8465239405632019
0 references
