Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Chris N. Potts / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Luk N. Van Wassenhove / rank | |||
Normal rank | |||
Revision as of 07:39, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming and decomposition approaches for the single machine total tardiness problem |
scientific article |
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
