Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A New Insight into the Coffman–Graham Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2734595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Performance of Garey-Johnson algorithm for pipelined typed tasks systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative algorithm for scheduling UET tasks with due dates and release times. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness / rank | |||
Normal rank |
Latest revision as of 05:25, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors |
scientific article |
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