A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034)
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 comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria |
scientific article; zbMATH DE number 5363304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria |
scientific article; zbMATH DE number 5363304 |
Statements
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (English)
0 references
7 November 2008
0 references
flexible flow shop
0 references
constructive algorithms
0 references
simulated annealing
0 references
tabu search
0 references
genetic algorithms
0 references
0 references
0 references
0 references
0.8490250110626221
0 references
0.8393759727478027
0 references
0.832859992980957
0 references
0.8295411467552185
0 references
0.825438380241394
0 references
