Two-machine flowshop scheduling problem with coupled-operations (Q2327688)

From MaRDI portal
Revision as of 04:13, 3 August 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
Two-machine flowshop scheduling problem with coupled-operations
scientific article

    Statements

    Two-machine flowshop scheduling problem with coupled-operations (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    flowshop
    0 references
    coupled-operations
    0 references
    complexity
    0 references
    polynomial time algorithms
    0 references

    Identifiers