Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765)
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: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling |
scientific article; zbMATH DE number 6681884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling |
scientific article; zbMATH DE number 6681884 |
Statements
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (English)
0 references
8 February 2017
0 references
flexible job shop scheduling
0 references
harmony search algorithm
0 references
multi-objective optimization
0 references
local search
0 references
0 references
0 references
0.8623090386390686
0 references
0.8494472503662109
0 references
0.8476364016532898
0 references
0.8239338397979736
0 references
0.8120511770248413
0 references
