Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251)
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: Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem |
scientific article; zbMATH DE number 5363515
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem |
scientific article; zbMATH DE number 5363515 |
Statements
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (English)
0 references
10 November 2008
0 references
simulated annealing
0 references
threshold accepting
0 references
tabu search
0 references
diversification
0 references
variable neighborhood search
0 references
resource-constrained scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
