Complexity of mixed shop scheduling problems: A survey (Q1969835)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of mixed shop scheduling problems: A survey
scientific article

    Statements

    Complexity of mixed shop scheduling problems: A survey (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    optimal scheduling
    0 references
    mixture of job and open shops
    0 references
    polynomial algorithm
    0 references
    NP-hard problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references