Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (Q4671306)
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: Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study |
scientific article; zbMATH DE number 2161405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study |
scientific article; zbMATH DE number 2161405 |
Statements
Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (English)
0 references
26 April 2005
0 references
0 references
0 references
0.7954146265983582
0 references
0.7852662205696106
0 references
0.7837365865707397
0 references
0.775730550289154
0 references
0.7757211923599243
0 references
