کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1142941 | 1489586 | 2012 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A primal–dual algorithm for computing a cost allocation in the core of economic lot-sizing games
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A primal–dual algorithm for computing a cost allocation in the core of economic lot-sizing games A primal–dual algorithm for computing a cost allocation in the core of economic lot-sizing games](/preview/png/1142941.png)
چکیده انگلیسی
We consider the economic lot-sizing game with general concave ordering cost functions. It is well-known that the core of this game is nonempty when the inventory holding costs are linear. The main contribution of this work is a combinatorial, primal–dual algorithm that computes a cost allocation in the core of these games in polynomial time. We also show that this algorithm can be used to compute a cost allocation in the core of economic lot-sizing games with remanufacturing under certain assumptions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 40, Issue 6, November 2012, Pages 453–458
Journal: Operations Research Letters - Volume 40, Issue 6, November 2012, Pages 453–458
نویسندگان
Mohan Gopaladesikan, Nelson A. Uhan, Jikai Zou,