Polynomial dynamic programming algorithms for lot sizing models with bounded inventory and stockout and/or backlogging - Archive ouverte HAL Access content directly
Journal Articles Journal of Systems Science and Systems Engineering Year : 2016

Polynomial dynamic programming algorithms for lot sizing models with bounded inventory and stockout and/or backlogging

Abstract

This paper addresses a dynamic lot sizing problem with bounded inventory and stockout where both no backlogging and backlogging allowed cases are considered. The stockout option means that there is outsourcing in a period only when the inventory level at that period is non-positive. The production capacity is unlimited and production cost functions are linear but with fixed charges. The problem is that of satisfying all demands in the planning horizon at minimal total cost. We show that the no backlogging case can be solved in ) O(T2) time with general concave inventory holding and outsourcing cost functions where T is the length of the planning horizon. The complexity can be reduced to O(T) when the inventory holding cost functions are also linear and have some realistic properties, even if the outsourcing cost functions remain general concave functions. When the inventory holding and outsourcing cost functions are linear, the backlogging case can be solved in O(T3logT) time whether the outsourcing level at each period is bounded by the sum of the demand of that period and backlogging level from previous periods, or only by the demand of that period.
No file

Dates and versions

hal-01180405 , version 1 (27-07-2015)

Identifiers

Cite

Jinhong Zhong, Feng Chu, Chengbin Chu, Shanlin Yang. Polynomial dynamic programming algorithms for lot sizing models with bounded inventory and stockout and/or backlogging. Journal of Systems Science and Systems Engineering, 2016, 25 (3), pp.370--397. ⟨10.1007/s11518-015-5277-x⟩. ⟨hal-01180405⟩
113 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More