کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482009 | 1446168 | 2008 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A discrete EOQ problem is solvable in O(logn) time
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A discrete EOQ problem is solvable in O(logn) time A discrete EOQ problem is solvable in O(logn) time](/preview/png/482009.png)
چکیده انگلیسی
The Economic Order Quantity problem is a fundamental problem of inventory management. An optimal solution to this problem in a closed form exists under the assumption that time and the product are continuously divisible and demand occurs at a constant rate λ. We prove that a discrete version of this problem, in which time and the product are discrete is solvable in O(logn) time, where n is the length of the time period where the demand takes place. The key elements of our approach are a reduction of the original problem to a discrete minimization problem of one variable representing the number of orders and a proof that the objective function of this problem is convex. According to our approach, optimal order sizes can take at most two distinct values: λnkâ and λnkâ, where kâ is the optimal number of orders.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 189, Issue 3, 16 September 2008, Pages 914-919
Journal: European Journal of Operational Research - Volume 189, Issue 3, 16 September 2008, Pages 914-919
نویسندگان
Alexandr Kovalev, C.T. Ng,