Please use this identifier to cite or link to this item:
Title: Polynomial-time solvability of dynamic lot size problems
Authors: Li, CL 
Li, Q
Keywords: Dynamic lot sizing
Dynamic programming
Polynomial-time algorithms
Issue Date: 2016
Publisher: World Scientific
Source: Asia-Pacific journal of operational research, 2016, v. 33, no. 3, 1650018 How to cite?
Journal: Asia-Pacific journal of operational research 
Abstract: There has been a lot of research on dynamic lot sizing problems with different nonlinear cost structures due to capacitated production, minimum order quantity requirements, availability of quantity discounts, etc. Developing optimal solutions efficiently for dynamic lot sizing models with nonlinear cost functions is a challenging topic. In this paper, we present a set of sufficient conditions such that if a single-item dynamic lot sizing problem satisfies these conditions, then the existence of a polynomial-time solution method for the problem is guaranteed. Several examples are presented to demonstrate the use of these sufficient conditions.
ISSN: 0217-5959
EISSN: 1793-7019
DOI: 10.1142/S0217595916500184
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Nov 11, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.