کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082733 | 1477653 | 2006 | 14 صفحه PDF | دانلود رایگان |
In this paper we study a class of multi-item lot-sizing problems with dynamic demands, as well as lower and upper bounds on a shared resource with a piecewise linear cost. The shared resource might be supply, production or transportation capacity. The model is particularly applicable to problems with joint shipping and/or purchasing cost discounts. The problem is formulated as a mixed-integer program. Lagrangean relaxation is used to decompose the problem into a set of simple sub-problems. A heuristic method based on sub-gradient optimization is then proposed to solve a particular case often encountered in the consumer goods wholesaling and retailing industry. Our tests show that the heuristic proposed is very efficient in solving large real-life supply planning problems.
Journal: International Journal of Production Economics - Volume 102, Issue 2, August 2006, Pages 344-357