Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (Q1277394)
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: Upper and lower bounds on the makespan of schedules for tree dags on linear arrays |
scientific article; zbMATH DE number 1248304
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds on the makespan of schedules for tree dags on linear arrays |
scientific article; zbMATH DE number 1248304 |
Statements
Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (English)
0 references
17 August 1999
0 references
binary tree directed acyclic graph
0 references
optimal schedule
0 references
0.9168505668640136
0 references
0.9168505668640136
0 references
0.9083518385887146
0 references
0.9066752195358276
0 references
0.8055521845817566
0 references