An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6034956 / rank
 
Normal rank
Property / zbMATH Keywords
 
production planning
Property / zbMATH Keywords: production planning / rank
 
Normal rank
Property / zbMATH Keywords
 
capacitated lot sizing problem
Property / zbMATH Keywords: capacitated lot sizing problem / rank
 
Normal rank
Property / zbMATH Keywords
 
single item
Property / zbMATH Keywords: single item / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum order quantities
Property / zbMATH Keywords: minimum order quantities / rank
 
Normal rank
Property / zbMATH Keywords
 
capacity constraints
Property / zbMATH Keywords: capacity constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049672007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs / 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 lot sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Lot-Sizing Models: A Polyhedral Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches / 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: Inventory replenishment model: lot sizing versus just-in-time delivery. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Production and Inventory Models with Piecewise Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and effective heuristics for the coordinated capacitated lot-size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Item Dynamic Lot Sizing Problem with Minimum Lot Size Restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimal solution method for the joint replenishment problem with minimum order quantities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:47, 5 July 2024

scientific article
Language Label Description Also known as
English
An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
scientific article

    Statements

    An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    production planning
    0 references
    capacitated lot sizing problem
    0 references
    single item
    0 references
    minimum order quantities
    0 references
    capacity constraints
    0 references
    dynamic programming
    0 references
    0 references