کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4960060 | 1445965 | 2017 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract](/preview/png/4960060.png)
چکیده انگلیسی
In this paper, we study the single-item lot sizing problem under a capacity reservation contract. A manufacturer is replenished by an external supplier with batch deliveries and a certain capacity is reserved at the supplier level with an advantageous cost. In addition to the classical ordering and inventory holding costs, for each batch ordered under the reserved capacity a fixed cost per batch is incurred; and for batches exceeding this capacity a higher fixed cost per batch is paid, typically through the purchase from the spot market. We identify various NP-hard cases, propose a pseudo-polynomial time dynamic programming algorithm under arbitrary parameters, show that the problem admits an FPTAS and give polynomial time algorithms for special cases. We finally state a list of open problems for further research.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 257, Issue 2, 1 March 2017, Pages 483-493
Journal: European Journal of Operational Research - Volume 257, Issue 2, 1 March 2017, Pages 483-493
نویسندگان
Ayse Akbalik, Atidel B. Hadj-Alouane, Nathalie Sauer, Houcem Ghribi,