A variant of the permutation flow shop model with variable processing times (Q1363747)

From MaRDI portal
Revision as of 17:11, 27 May 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 variant of the permutation flow shop model with variable processing times
scientific article

    Statements

    A variant of the permutation flow shop model with variable processing times (English)
    0 references
    0 references
    0 references
    24 February 1998
    0 references
    makespan minimization
    0 references
    variable processing times
    0 references
    flow shop
    0 references
    infinite buffer capacities
    0 references
    greedy placement algorithm
    0 references

    Identifiers