کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482006 | 1446168 | 2008 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A single-item economic lot-sizing problem with a non-uniform resource: Approximation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A single-item economic lot-sizing problem with a non-uniform resource: Approximation A single-item economic lot-sizing problem with a non-uniform resource: Approximation](/preview/png/482006.png)
چکیده انگلیسی
We study a generalization of the classical single-item capacitated economic lot-sizing problem to the case of a non-uniform resource usage for production. The general problem and several special cases are shown to be non-approximable with any polynomially computable relative error in polynomial time. An optimal dynamic programming algorithm and its approximate modification are presented for the general problem. Fully polynomial time approximation schemes are developed for two NP-hard special cases: (1) cost functions of total production are separable and holding and backlogging cost functions are linear with polynomially related slopes, and (2) all holding costs are equal to zero.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 189, Issue 3, 16 September 2008, Pages 877–889
Journal: European Journal of Operational Research - Volume 189, Issue 3, 16 September 2008, Pages 877–889
نویسندگان
Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch,