A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:07, 30 January 2024

scientific article
Language Label Description Also known as
English
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
scientific article

    Statements

    A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    bottleneck-based multiple insertion heuristic
    0 references
    flexible flow line
    0 references
    bottleneck
    0 references
    unrelated parallel machines
    0 references
    makespan
    0 references

    Identifiers