The flow shop with parallel machines: A tabu search approach (Q1609888): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
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: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop 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: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hashing vectors for tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank

Latest revision as of 14:58, 4 June 2024

scientific article
Language Label Description Also known as
English
The flow shop with parallel machines: A tabu search approach
scientific article

    Statements

    The flow shop with parallel machines: A tabu search approach (English)
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    heuristics
    0 references
    flexible flow line
    0 references
    flow-shop
    0 references
    parallel machines
    0 references
    tabu search
    0 references