A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561)
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: A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion |
scientific article; zbMATH DE number 7169944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion |
scientific article; zbMATH DE number 7169944 |
Statements
A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (English)
0 references
20 February 2020
0 references
flowshop scheduling
0 references
no-idle permutation
0 references
NEH
0 references
IGA
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8366992473602295
0 references
0.8303338885307312
0 references
0.828504741191864
0 references
0.7909791469573975
0 references
