Permutation vs. non-permutation flow shop schedules (Q1180831)

From MaRDI portal
Revision as of 06:39, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q170009)
scientific article
Language Label Description Also known as
English
Permutation vs. non-permutation flow shop schedules
scientific article

    Statements

    Permutation vs. non-permutation flow shop schedules (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    approximation algorithms
    0 references
    flow shop scheduling
    0 references
    permutation schedules
    0 references
    maximum completion time
    0 references

    Identifiers