A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881)
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: A new dynamic programming algorithm for the parallel machines total weighted completion time problem |
scientific article; zbMATH DE number 91997
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new dynamic programming algorithm for the parallel machines total weighted completion time problem |
scientific article; zbMATH DE number 91997 |
Statements
A new dynamic programming algorithm for the parallel machines total weighted completion time problem (English)
0 references
16 January 1993
0 references
pseudopolynomial complexity
0 references
total weighted completion time
0 references
parallel identical machines
0 references
0 references
