New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784)
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: New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems |
scientific article; zbMATH DE number 7485360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems |
scientific article; zbMATH DE number 7485360 |
Statements
New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (English)
0 references
7 March 2022
0 references
flowshop
0 references
scheduling
0 references
makespan
0 references
Nawaz-Enscore-Ham (NEH) heuristic
0 references
tie-breaking
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9211859703063964
0 references
0.8961464166641235
0 references
0.8556963205337524
0 references
0.8323552012443542
0 references
0.8196999430656433
0 references
