A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:09, 5 March 2024

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
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    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