A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828)
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: A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems |
scientific article |
Statements
A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (English)
0 references
11 June 1998
0 references
jobs with arbitrary time lags
0 references
local search
0 references
simulated annealing
0 references
threshold accepting
0 references
single-server system
0 references
maximum completion time
0 references
mean completion time
0 references
adaptive neighbourhood search
0 references
0 references
0 references
0 references
0 references
0 references
