A new heuristic for the n-job, M-machine flow-shop problem (Q2277356)

From MaRDI portal
Revision as of 11:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new heuristic for the n-job, M-machine flow-shop problem
scientific article

    Statements

    A new heuristic for the n-job, M-machine flow-shop problem (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    production scheduling
    0 references
    machine sequencing
    0 references
    flow-shop scheduling
    0 references
    heuristic
    0 references
    simulation
    0 references
    makespan
    0 references
    mean flow time
    0 references
    mean utilization
    0 references
    0 references