A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656)
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 two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function |
scientific article; zbMATH DE number 6114316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function |
scientific article; zbMATH DE number 6114316 |
Statements
A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (English)
0 references
7 December 2012
0 references
scheduling
0 references
two-machine
0 references
genetic algorithm
0 references
truncated learning function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8706026077270508
0 references
0.8640236258506775
0 references
0.8617839217185974
0 references
0.8609835505485535
0 references
0.8540248274803162
0 references
