The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem (Q3941152)

From MaRDI portal
Revision as of 22:17, 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
The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
scientific article

    Statements

    The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    two-product, single-machine, static demand, infinite horizon lot scheduling
    0 references
    optimal solution algorithm
    0 references
    N-product schedules
    0 references
    necessary and sufficient feasibility conditions
    0 references
    0 references