A comparative study of algorithms for the flowshop scheduling problem (Q3626434)
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 5556504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparative study of algorithms for the flowshop scheduling problem |
scientific article; zbMATH DE number 5556504 |
Statements
22 May 2009
0 references
machine scheduling
0 references
permutation flowshop
0 references
general flowshop
0 references
meta-heuristic
0 references
neighborhood structure
0 references
makespan
0 references
0.8100243210792542
0 references
0.8027259707450867
0 references
0.7989053130149841
0 references
0.792826771736145
0 references
0.7915592193603516
0 references
