An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401)
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: An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs |
scientific article; zbMATH DE number 936185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs |
scientific article; zbMATH DE number 936185 |
Statements
An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (English)
0 references
16 October 1996
0 references
minimum weighted completion time scheduling problem
0 references
transitive series parallel graphs
0 references
NC algorithm
0 references
0 references
0 references
