Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems (Q5464237): 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.1057/palgrave.jors.2601868 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963506405 / rank | |||
Normal rank | |||
Latest revision as of 20:19, 19 March 2024
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
