The discrete lot-sizing and scheduling problem (Q582202)

From MaRDI portal
Revision as of 08:45, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The discrete lot-sizing and scheduling problem
scientific article

    Statements

    title
    The discrete lot-sizing and scheduling problem (English)
    0 references
    publication date
    1990
    0 references
    Mathematics Subject Classification ID
    90B30
    0 references
    90B35
    0 references
    65K05
    0 references
    90C39
    0 references
    90C90
    0 references
    90B05
    0 references
    zbMATH DE Number
    4130177
    0 references
    zbMATH Keywords
    manufacturing
    0 references
    Lagrange multipliers
    0 references
    discrete lot-sizing
    0 references
    scheduling several products
    0 references
    branch-and-bound
    0 references
    Lagrangean relaxation
    0 references
    Computational results
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q582202&oldid=12481614"
    Powered by MediaWiki