A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291)
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 hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop |
scientific article; zbMATH DE number 6952133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop |
scientific article; zbMATH DE number 6952133 |
Statements
A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (English)
0 references
11 October 2018
0 references
multi-processor open shop scheduling problems
0 references
makespan
0 references
imperialist competitive algorithm
0 references
genetic algorithm
0 references
response surface methodology
0 references
0 references
0 references
0 references
0.8455336689949036
0 references
0.760860025882721
0 references
0.7564561367034912
0 references
0.7557767629623413
0 references
0.7505707144737244
0 references
