A polynomial time algorithm for convex cost lot-sizing problems

DOI10.1016/J.ORL.2015.03.009zbMATH Open1408.90021OpenAlexW2027805151MaRDI QIDQ1785380FDOQ1785380

Authors: 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

Recommendations

• A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• Polynomial-time solvability of dynamic lot size problems
• A polynomial time algorithm for economic lot-size problem with a class of multi-breakpoint discount cost structures
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• A polynomial time algorithm for the two-supplier economic lot-size problem
• A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers
• Publication:4885531
• Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
• scientific article; zbMATH DE number 3945840

zbMATH Keywords

supply chain managementpolynomial time algorithmsproduction and inventory systemsconvex cost lot sizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• Dynamic version of the economic lot size model
• Deterministic Production Planning: Algorithms and Complexity
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
• Single item lot sizing problems
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• On optimality conditions in nondifferentiable programming
• An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
• 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
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

Cited In (8)

• A dynamic programming approach for a class of robust optimization problems
• Polynomial-time solvability of dynamic lot size problems
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• Lot-sizing with fixed charges on stocks: the convex hull
• Primal dual approach to the multilevel capacitated lot-sizing problem
• Lot-sizing polyhedra with a cardinality constraint
• A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers
• Polyhedra for lot-sizing with Wagner-Whitin costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785380)