کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082383 | 1477638 | 2008 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Single machine scheduling with outsourcing allowed
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers a single-machine scheduling problem with outsourcing allowed, where each job can be either processed on an in-house single-machine or outsourced. Outsourcing is commonly required as a way to improve productivity effectively and efficiently in various companies, especially, including electronics industries and motor industries. The objective is to minimize the weighted sum of the outsourcing cost and the scheduling measure represented by the sum of completion times, subject to outsourcing budget. In the problem analysis, it is proved that the proposed problem is NP-hard in the ordinary sense, and some solution properties are characterized. Therewith, two associated heuristic algorithms and the branch-and-bound algorithm are derived. Numerical experiments are conducted to evaluate the performance of the derived algorithms, and some managerial insights of the heuristic algorithms are provided.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 111, Issue 2, February 2008, Pages 623-634
Journal: International Journal of Production Economics - Volume 111, Issue 2, February 2008, Pages 623-634
نویسندگان
Ik Sun Lee, C.S. Sung,