Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493): 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.2021.105373 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3160890116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity Acquisition, Subcontracting, and Lot Sizing / 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: On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing and production lot-size/scheduling with finite capacity for a deteriorating item over a finite horizon / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-item economic lot-sizing problem with a non-uniform resource: Approximation / 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: Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic lot size model with quantity discount / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log 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: A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic lot-sizing problem with quantity discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot-sizing model under perishability, substitution, and limited storage capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing with Piecewise Concave Production Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic lot sizing problem with nervousness considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Lot Sizing with Batch Ordering and Truckload Discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot sizing with all‐units discount and resales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing for production and delivery flexibility in single-item lot-sizing / 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: A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimal algorithm for the quantity discount problem in material requirement planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic lot sizing with constant capacities and concave inventory costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact algorithms to economic lot-sizing with piecewise linear production costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic quantity discount lot size model with resales / 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: Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic lot sizing problem with piecewise linear concave ordering costs / 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: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic lot size model with quantity discount: Counterexamples and correction / 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 06:36, 28 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
scientific article

    Statements

    Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    capacitated lot sizing problem
    0 references
    all-units quantity discount
    0 references
    polynomial exact algorithm
    0 references
    implicit enumeration algorithm
    0 references

    Identifiers