On the hardness of the classical job shop problem (Q1960323)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the hardness of the classical job shop problem
scientific article

    Statements

    On the hardness of the classical job shop problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2000
    0 references
    0 references
    open shop
    0 references
    job shop
    0 references
    irreducible sequences
    0 references
    enumeration
    0 references
    0 references