On the complexity of a periodic scheduling problem with precedence relations (Q2692207)
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: On the complexity of a periodic scheduling problem with precedence relations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of a periodic scheduling problem with precedence relations |
scientific article |
Statements
On the complexity of a periodic scheduling problem with precedence relations (English)
0 references
21 March 2023
0 references
