A new characterization for the dynamic lot size problem with bounded inventory
type: Item
instance of: scholarly article
title: A new characterization for the dynamic lot size problem with bounded inventory
zbMATH Open document ID: 1029.90006
DOI: 10.1016/S0305-0548(01)00105-8
published in: Computers \& Operations Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1902981
zbMATH Keywords: Inventory
zbMATH Keywords: dynamic lot sizing
zbMATH Keywords: complexity
author: José M. Gutiérrez
author: Antonio Sedeño-Noda
author: Marcos Colebrook
author: J. Sicilia
MaRDI profile type: Publication
cites work: Dynamic version of the economic lot size model
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging
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
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
cites work: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Approximation Formulations for the Single-Product Capacitated Lot Size Problem
cites work: An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
cites work: Bounded Production and Inventory Models with Piecewise Concave Costs
cites work: Contraction Mappings in the Theory Underlying Dynamic Programming
full work available at URL: s0305-0548(01)00105-8
OpenAlex ID: W2049240151
description: scientific article; zbMATH DE number 1902981