A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
type: Item
instance of: scholarly article
title: A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
zbMATH Open document ID: 1409.90022
author: Jinwen Ou
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7027775
zbMATH Keywords: algorithm
zbMATH Keywords: economic lot-sizing
zbMATH Keywords: constant capacity
zbMATH Keywords: dynamic programming
zbMATH Keywords: concave ordering costs
MaRDI profile type: Publication
full work available at URL: j.orl.2017.07.010
OpenAlex ID: W2744475252
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Economic lot sizing with constant capacities and concave inventory costs
cites work: Improved exact algorithms to economic lot-sizing with piecewise linear production costs
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
DOI: 10.1016/J.ORL.2017.07.010
description: scientific article; zbMATH DE number 7027775