Solvable Cases of the No-wait Flow-shop Scheduling Problem (Q3984309)

From MaRDI portal
Revision as of 12:04, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solvable Cases of the No-wait Flow-shop Scheduling Problem
scientific article

    Statements

    Solvable Cases of the No-wait Flow-shop Scheduling Problem (English)
    0 references
    0 references
    27 June 1992
    0 references
    no-wait flow-shop scheduling
    0 references
    makespan objective function
    0 references
    travelling salesman
    0 references
    polynomial solvable cases
    0 references
    semi-ordered processing times
    0 references
    mean objective function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references