Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560): 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/s10951-015-0438-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174653384 / rank | |||
Normal rank | |||
Revision as of 20:36, 19 March 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
