کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1142410 | 957147 | 2013 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
NP-hardness proof for the assembly problem with stationary setup and additive holding costs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: NP-hardness proof for the assembly problem with stationary setup and additive holding costs NP-hardness proof for the assembly problem with stationary setup and additive holding costs](/preview/png/1142410.png)
چکیده انگلیسی
In this paper we answer a long-standing open question regarding the computational complexity of one of the core problems in inventory management, the assembly problem. In spite of effort on part of many researchers over the years to design efficient optimization algorithms for the problem, or alternatively prove that it is NPNP-hard, this fundamental question was left unanswered. In this paper, we provide a proof that the problem is indeed NPNP-hard, so it is not likely that there exists an efficient algorithm that solves the problem optimally.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 41, Issue 2, March 2013, Pages 134–137
Journal: Operations Research Letters - Volume 41, Issue 2, March 2013, Pages 134–137
نویسندگان
Retsef Levi, Liron Yedidsion,