a polynomial time algorithm for convex cost lot-sizing problems：凸成本批量问题的多项式时间算法.pdfVIP

Operations Research Letters 43 (2015) 359–364 Contents lists available at ScienceDirect Operations Research Letters journal homepage: /locate/orl A polynomial time algorithm for convex cost lot-sizing problems Z. Melis Teksan, Joseph Geunes ∗ Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611, USA a r t i c l e i n f o a b s t r a c t Article history: This paper provides a polynomial-time algorithm for economic lot-sizing problems with convex costs Received 4 December 2014 in the production and inventory quantities. The resulting algorithm is based on a primal–dual approach Received in revised form that takes advantage of the problem’s special structure. This approach improves upon existing results 25 March 2015 in the literature, which are either pseudo-polynomial or focus on special cases. We apply the approach Accepted 28 March 2015 to a production planning problem with price-dependent supply, leading to an improved bound on the Available online 17 April 2015 algorithm’s running time for a special case. © 2015 Elsevier B.V. All rights reserved. Keywords: Convex cost lot sizing Polynomial time algorithms Production and inventory systems Supply chain management 1. Introduction settings exist with eco