Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter
✍ Scribed by Stanislaw Bylka
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 122 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
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.