A new heuristic method for the flow shop sequencing problem (Q1119464)

From MaRDI portal
Revision as of 14:11, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A new heuristic method for the flow shop sequencing problem
scientific article

    Statements

    A new heuristic method for the flow shop sequencing problem (English)
    0 references
    0 references
    0 references
    1989
    0 references
    makespan
    0 references
    heuristic
    0 references
    m-machine, n-job flow shop scheduling
    0 references
    SPIRIT
    0 references
    travelling salesman
    0 references
    taboo search
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references