کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477062 | 1446101 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dynamic lot sizing for multiple products with a new joint replenishment model
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Dynamic lot sizing for multiple products with a new joint replenishment model Dynamic lot sizing for multiple products with a new joint replenishment model](/preview/png/477062.png)
چکیده انگلیسی
This paper studies a new multi-product dynamic lot sizing problem, where the inventories of all products are replenished jointly with the same quantity whenever a production occurs. Such problems may occur in poultry and some chemical industries. We first introduce the general problem that allows for demand rejection with lost sales cost, and prove that the problem is NP-hard. Then we study a special case where all demands have to be satisfied immediately, and show that it can be solved in polynomial time. Finally, we develop two heuristic algorithms for the general problem. Through computational experiments, we demonstrate the effectiveness of the heuristics and investigate some insights related to the decision of lost sales.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 212, Issue 1, 1 July 2011, Pages 74–80
Journal: European Journal of Operational Research - Volume 212, Issue 1, 1 July 2011, Pages 74–80
نویسندگان
Liang Lu, Xiangtong Qi,