Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173)
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: Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics |
scientific article; zbMATH DE number 6654088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics |
scientific article; zbMATH DE number 6654088 |
Statements
Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (English)
0 references
17 November 2016
0 references
job shop scheduling
0 references
total weighted tardiness
0 references
shifting bottleneck procedure
0 references
decomposition
0 references
dominance rule
0 references
iterated local search
0 references
0 references
0 references
0 references
0 references
0 references
0.9002846479415894
0 references
0.8915781378746033
0 references
0.8602120876312256
0 references
0.8419625759124756
0 references
