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

From MaRDI portal
Revision as of 20:30, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129475786, #quickstatements; #temporary_batch_1726341741784)
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