A lot-sizing problem in an automated foundry (Q1598716)

From MaRDI portal
Revision as of 02:40, 4 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127813680, #quickstatements; #temporary_batch_1725413904772)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A lot-sizing problem in an automated foundry
scientific article

    Statements

    title
    A lot-sizing problem in an automated foundry (English)
    0 references
    publication date
    28 May 2002
    0 references
    zbMATH Keywords
    linear and integer programming
    0 references
    lot sizing
    0 references
    scheduling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    90C05
    0 references
    90C10
    0 references
    zbMATH DE Number
    1746183
    0 references
    OpenAlex ID
    W1974331731
    0 references
    Wikidata QID
    Q127813680
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1598716&oldid=37661459"
    Powered by MediaWiki