A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5080332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem |
scientific article; zbMATH DE number 5080332 |
Statements
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (English)
0 references
14 December 2006
0 references
iterated greedy
0 references
flowshop scheduling
0 references
metaheuristics
0 references
0 references
0 references
0 references
0 references
0.8674557209014893
0 references
0.8495497107505798
0 references
0.8452647924423218
0 references
0.8364109992980957
0 references
