On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102124631 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2003.04438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item uncapacitated lot sizing problem with inventory bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of uncapacitated multi-echelon production planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-item dynamic lot-sizing problems: an updated survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reformulations for the one-warehouse multi-retailer problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling industrial lot sizing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated two-level lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP formulations and heuristics for two-level production-transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for production and distribution planning in supply chain management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers / 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 Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank

Latest revision as of 17:34, 25 July 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of uncapacitated multi-plant lot-sizing problems
scientific article

    Statements

    On the computational complexity of uncapacitated multi-plant lot-sizing problems (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-plant lot-sizing
    0 references
    production planning
    0 references
    computational complexity
    0 references
    NP-hard
    0 references
    0 references
    0 references