Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650)
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: Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors |
scientific article; zbMATH DE number 6033998
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors |
scientific article; zbMATH DE number 6033998 |
Statements
Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (English)
0 references
13 May 2012
0 references
scheduling theory
0 references
dedicated processors
0 references
unit execution times
0 references
precedence delays
0 references
maximum lateness
0 references
worst-case analysis
0 references
