Capacitated lot sizing problems with inventory bounds
type: Item
instance of: scholarly article
title: Capacitated lot sizing problems with inventory bounds
zbMATH Open document ID: 1318.90026
author: Ayse Akbalik
author: Bernard Penz
author: Christophe Rapine
published in: Annals of Operations Research
publication date: 2015-08-21T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6474548
zbMATH Keywords: lot sizing problem
zbMATH Keywords: multi-item
zbMATH Keywords: single-item
zbMATH Keywords: inventory bounds
zbMATH Keywords: dynamic programming
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10479-015-1816-6
OpenAlex ID: W2008685592
cites work: Multi-item uncapacitated lot sizing problem with inventory bounds
cites work: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
cites work: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
cites work: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Q4198056
cites work: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
cites work: Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
cites work: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
cites work: Bounded Production and Inventory Models with Piecewise Concave Costs
cites work: A note on ``The economic lot sizing problem with inventory bounds''
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
cites work: Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities''
cites work: An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
cites work: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
cites work: Dynamic version of the economic lot size model
cites work: Lot-sizing with production and delivery time windows
DOI: 10.1007/S10479-015-1816-6
description: scientific article; zbMATH DE number 6474548