A polynomial time algorithm for convex cost lot-sizing problems

DOI10.1016/j.orl.2015.03.009zbMath1408.90021OpenAlexW2027805151MaRDI QIDQ1785380

Z. Melis Teksan, Joseph Geunes

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.03.009

zbMATH Keywords

supply chain managementpolynomial time algorithmsproduction and inventory systemsconvex cost lot sizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (1)

A Dynamic Programming Approach for a Class of Robust Optimization Problems

Cites Work

• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
• Four equivalent lot-sizing models
• Single item lot sizing problems
• Dynamic Version of the Economic Lot Size Model
• An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
• Deterministic Production Planning: Algorithms and Complexity
• On optimality conditions in nondifferentiable programming
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: A polynomial time algorithm for convex cost lot-sizing problems