Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560): Difference between revisions
From MaRDI portal
Latest revision as of 08:22, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Identical coupled task scheduling: polynomial complexity of the cyclic case |
scientific article |
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