Premium
Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter
Author(s) -
Bylka Stanislaw
Publication year - 1997
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199712)44:8<775::aid-nav5>3.0.co;2-7
Subject(s) - sizing , mathematical optimization , simple (philosophy) , product (mathematics) , class (philosophy) , inverse , computer science , time horizon , mathematical economics , economics , operations research , mathematics , art , philosophy , geometry , epistemology , artificial intelligence , visual arts
This article considers optimization problems in a discrete capacitated lot sizing model for a single product with limited backlogging. The demand as well as the holding and backlogging costs are assumed to be periodical in time. Nothing is assumed about types of the cost functions. It is shown that there exists an optimal infinite inverse policy and a strong turnpike policy. A forward algorithm for computing optimal policies relative to the class of batch ordering type policies is derived. Some backward procedure is adopted to determine a strong turnpike policy. The algorithm is simple, and it terminates after the a number of steps equal to the turnpike horizon. Some remarks on the existence of rolling horizontal plans and forecast horizons are also given. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 775–790, 1997