The complexity of two group scheduling problems (Q1860372)

From MaRDI portal
Revision as of 20:18, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57387829, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
The complexity of two group scheduling problems
scientific article

    Statements

    title
    The complexity of two group scheduling problems (English)
    0 references
    author
    Jacek Błażewicz
    0 references
    Mikhail Y. Kovalyov
    0 references
    publication date
    23 February 2003
    0 references
    zbMATH Keywords
    scheduling
    0 references
    group technology
    0 references
    parallel machines
    0 references
    open shop
    0 references

    Identifiers

    DOI
    10.1002/jos.118
    0 references
    zbMATH DE Number
    1872734
    0 references
    Wikidata QID
    Q57387829
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1860372&oldid=15049083"
    Powered by MediaWiki