A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097)

From MaRDI portal
Revision as of 13:29, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for a multi-item capacitated production planning problem
scientific article

    Statements

    A polynomial algorithm for a multi-item capacitated production planning problem (English)
    0 references
    0 references
    0 references
    14 March 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-item
    0 references
    lot sizing
    0 references
    computational bound
    0 references
    production planning
    0 references
    manufacturing
    0 references
    polynomial time algorithm
    0 references
    worst case computational bound
    0 references
    single machine static scheduling
    0 references