Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281)
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 makespan for a bipartite graph on a single processor with an integer precedence delay. |
scientific article; zbMATH DE number 2125920
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. |
scientific article; zbMATH DE number 2125920 |
Statements
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (English)
0 references
11 January 2005
0 references
Sequencing
0 references
Precedence delays
0 references
Makespan
0 references
Computational complexity
0 references
0 references
0 references
