Two-Machine Super-Shop Scheduling Problem (Q3978740)

From MaRDI portal
Revision as of 20:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two-Machine Super-Shop Scheduling Problem
scientific article

    Statements

    title
    Two-Machine Super-Shop Scheduling Problem (English)
    0 references
    publication date
    25 June 1992
    0 references
    zbMATH Keywords
    two-machine super-shop
    0 references
    flow-shop
    0 references
    job-shop
    0 references
    open-shop
    0 references
    mixed-shop
    0 references
    polynomial algorithm
    0 references
    makespan
    0 references

    Identifiers

    DOI
    10.1057/jors.1991.96
    0 references
    zbMATH DE Number
    12795
    0 references
    OpenAlex ID
    W2037726054
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3978740&oldid=31824029"
    Powered by MediaWiki