Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153518835 / 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 Multi-Period Production Scheduling Model with Backlogging / 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
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Infinite Horizon Periodic Review Problem with Setup Costs and Capacity Constraints: A Partial Characterization of the Optimal Policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs / rank
 
Normal rank
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: 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: An effective algorithm for the capacitated single item lot size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / 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: 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: Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the single item capacitated dynamic lot size model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for dynamic lot size models with piecewise linear costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Formulations for the Single-Product Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Algorithms for Deterministic Inventory Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress with single-item lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot sizing and scheduling -- survey and extensions / 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>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: X-Y Band and Modified (<i>s</i>, <i>S</i>) Policy / rank
 
Normal rank

Latest revision as of 14:44, 3 July 2024

scientific article
Language Label Description Also known as
English
Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
scientific article

    Statements

    Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    inventory
    0 references
    dynamic programming
    0 references
    stochastic programming
    0 references
    algorithm complexity
    0 references
    0 references
    0 references
    0 references
    0 references