Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems (Q5464237)
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: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems |
scientific article; zbMATH DE number 2195288
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems |
scientific article; zbMATH DE number 2195288 |
Statements
Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems (English)
0 references
17 August 2005
0 references
metaheuristics
0 references
multiple-objective combinatorial optimization
0 references
compromise solutions
0 references
scheduling
0 references
tabu search
0 references
variable neighbourhood search
0 references
0.9107068
0 references
0.9100455
0 references
0.8979533
0 references
0.8899178
0 references
0.8892895
0 references
0.88783467
0 references
