کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6895357 | 1445942 | 2018 | 30 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the decomposition property for a dynamic inventory rationing problem with multiple demand classes and backorder
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper, we study a dynamic inventory rationing problem of a single item with multiple demand classes and backorder. Demand classes are differentiated by their unit backlogging costs. The corresponding dynamic programming problem is multidimensional and computationally challenging. With a novel state transformation, we find that the optimal policy can be described by a nested base stock policy. In particular, we can decompose the value function as the sum of single-variable convex functions. This property breaks the curse of dimensionality and significantly reduces computational effort in computing optimal policies. Our approach allows us to extend the results to systems with ordering, exogenous supply, priority upgrading.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 265, Issue 1, 16 February 2018, Pages 99-106
Journal: European Journal of Operational Research - Volume 265, Issue 1, 16 February 2018, Pages 99-106
نویسندگان
Lina Bao, Zhiying Liu, Yimin Yu, Wei Zhang,