Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Facilities in Series Inventory Model with Nested Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Continuous Review Deterministic One-Warehouse <i>N</i>-Retailer Inventory Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Multiproduct, Multi-Facility Production and Inventory Model / rank
 
Normal rank

Latest revision as of 15:40, 19 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of uncapacitated multi-echelon production planning problems
scientific article

    Statements

    Computational complexity of uncapacitated multi-echelon production planning problems (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    production planning
    0 references
    multi-echelon production-distribution systems
    0 references
    computational complexity
    0 references
    assembly system
    0 references
    joint replenishment system
    0 references
    Polynomial time algorithms
    0 references
    NP-complete
    0 references
    0 references