Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem (Q4346870)
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: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem |
scientific article; zbMATH DE number 1044018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem |
scientific article; zbMATH DE number 1044018 |
Statements
5 August 1997
0 references
polynomial decomposition heuristic
0 references
parallel-machine tardiness problem
0 references
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem (English)
0 references
0.89895505
0 references
0.8977805
0 references
0.8970895
0 references
0.8869828
0 references
0.8813622
0 references
0.8781111
0 references
0.8759213
0 references
