Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805)
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: Dynamic programming and decomposition approaches for the single machine total tardiness problem |
scientific article; zbMATH DE number 4020834
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming and decomposition approaches for the single machine total tardiness problem |
scientific article; zbMATH DE number 4020834 |
Statements
Dynamic programming and decomposition approaches for the single machine total tardiness problem (English)
0 references
1987
0 references
The problem of sequencing jobs on a single machine to minimize total tardiness is considered. General precedence constrained dynamic programming algorithms and special-purpose decomposition algorithms are presented. Computational results for problems with up to 100 are given.
0 references
sequencing
0 references
single machine
0 references
total tardiness
0 references
precedence constrained
0 references
decomposition
0 references
Computational results
0 references
0 references
0.9485103
0 references
0.9313433
0 references
0.9310423
0 references
0.9222171
0 references
0.9131362
0 references
0.91084766
0 references
0.91000265
0 references
0.9063436
0 references
0.9054785
0 references
0.9037021
0 references
