The complexity of two group scheduling problems (Q1860372)

From MaRDI portal
Revision as of 23:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The complexity of two group scheduling problems
scientific article

    Statements

    The complexity of two group scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2003
    0 references
    0 references
    scheduling
    0 references
    group technology
    0 references
    parallel machines
    0 references
    open shop
    0 references
    0 references
    0 references