Scheduling an interval ordered precedence graph with communication delays and a limited number of processors (Q2845034)
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: Scheduling an interval ordered precedence graph with communication delays and a limited number of processors |
scientific article; zbMATH DE number 6200391
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling an interval ordered precedence graph with communication delays and a limited number of processors |
scientific article; zbMATH DE number 6200391 |
Statements
Scheduling an interval ordered precedence graph with communication delays and a limited number of processors (English)
0 references
22 August 2013
0 references
approximation and complexity
0 references
combinatorial optimization
0 references
scheduling
0 references
