Benchmarks for basic scheduling problems (Q2366085): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56004684, #quickstatements; #temporary_batch_1714933964039
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Latest revision as of 18:07, 17 May 2024

scientific article
Language Label Description Also known as
English
Benchmarks for basic scheduling problems
scientific article

    Statements

    Benchmarks for basic scheduling problems (English)
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    benchmarks
    0 references
    randomly generated scheduling problems
    0 references
    industrial problems
    0 references
    permutation flow shop
    0 references
    job shop
    0 references
    open shop
    0 references
    makespan
    0 references
    0 references