An effective algorithm for the capacitated single item lot size problem (Q1331619): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints / 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: Planning Horizons for the Dynamic Lot Size Model with Backlogging / 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: Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / 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: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the capacitated single item dynamic lot size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Horizons for Production Smoothing with Deterministic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Planning Horizons for Production Smoothing with Deterministic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity constrained singlefacility dynamic lot-size model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Lot-Size Model with Make-or-Buy Decisions / 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: Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Forward Algorithm for the Capacitated Lot Size Model with Stockouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme points of Leontief substitution systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / 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:26, 22 May 2024

scientific article
Language Label Description Also known as
English
An effective algorithm for the capacitated single item lot size problem
scientific article

    Statements

    An effective algorithm for the capacitated single item lot size problem (English)
    0 references
    0 references
    0 references
    0 references
    21 August 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    deterministic, single product capacitated dynamic lot size model
    0 references
    growth constraint
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references
    NP-hard
    0 references
    0 references
    0 references