Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem (Q1195679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 85871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem |
scientific article; zbMATH DE number 85871 |
Statements
Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem (English)
0 references
5 January 1993
0 references
parallel machines
0 references
weighted sum machine makespans
0 references
dynamic program
0 references
pseudo-polynomial
0 references
0.8614053130149841
0 references
0.8372718691825867
0 references
0.8238186836242676
0 references
0.8152541518211365
0 references
0.8078936338424683
0 references
