A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871)

From MaRDI portal
Revision as of 22:26, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
scientific article

    Statements

    A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (English)
    0 references
    0 references
    0 references
    1990
    0 references
    fully polynomial approximation
    0 references
    single-product scheduling
    0 references
    finite capacity facility
    0 references
    lot sizing
    0 references
    timing of production lots
    0 references
    single facility
    0 references
    deterministic dynamic demands
    0 references
    finite continuous time planning horizon
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references