The basic cyclic scheduling problem with linear precedence constraints (Q1917250): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3696527 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The basic cyclic scheduling problem with deadlines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5583694 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays / rank | |||
Normal rank |
Latest revision as of 13:08, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The basic cyclic scheduling problem with linear precedence constraints |
scientific article |
Statements
The basic cyclic scheduling problem with linear precedence constraints (English)
0 references
24 October 1996
0 references
generic tasks
0 references
precedence constraint
0 references