An assignment-based lower bound for a class of two-machine flow shop problems (Q336351)

From MaRDI portal
Revision as of 21:38, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An assignment-based lower bound for a class of two-machine flow shop problems
scientific article

    Statements

    An assignment-based lower bound for a class of two-machine flow shop problems (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    flow shop
    0 references
    linear assignment
    0 references
    total completion times
    0 references
    total tardiness
    0 references

    Identifiers