Tabu list management methods for a discrete-continuous scheduling problem (Q1600837): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127481974, #quickstatements; #temporary_batch_1723488958199
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a methodology for discrete-continuous scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search metaheuristics for discrete-continuous scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127481974 / rank
 
Normal rank

Latest revision as of 20:59, 12 August 2024

scientific article
Language Label Description Also known as
English
Tabu list management methods for a discrete-continuous scheduling problem
scientific article

    Statements

    Tabu list management methods for a discrete-continuous scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete-continuous scheduling
    0 references
    makespan
    0 references
    tabu search
    0 references
    tabu navigation method
    0 references
    cancellation sequence method
    0 references
    reverse elimination method
    0 references
    0 references
    0 references
    0 references