A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apm.2013.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081123989 / rank | |||
Normal rank | |||
Revision as of 18:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop |
scientific article |
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
