The Complexity of Flowshop and Jobshop Scheduling (Q4180114)

From MaRDI portal
Revision as of 17:30, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q63353547, #quickstatements; #temporary_batch_1707232231678)
scientific article; zbMATH DE number 3616166
Language Label Description Also known as
English
The Complexity of Flowshop and Jobshop Scheduling
scientific article; zbMATH DE number 3616166

    Statements

    title
    The Complexity of Flowshop and Jobshop Scheduling (English)
    0 references
    author
    Michael R. Garey
    0 references
    David S. Johnson
    0 references
    Ravi Sethi
    0 references
    publication date
    1976
    0 references
    zbMATH Keywords
    Complexity
    0 references
    Flow Shop Scheduling
    0 references
    Jobshop Scheduling
    0 references
    Np-Complete Problems
    0 references

    Identifiers

    DOI
    10.1287/moor.1.2.117
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C90
    0 references
    68Q25
    0 references
    65K05
    0 references
    zbMATH DE Number
    3616166
    0 references
    Wikidata QID
    Q63353547
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4180114&oldid=18176969"
    Powered by MediaWiki