کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9664084 | 1446256 | 2005 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Makespan minimization for two parallel machines with an availability constraint
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we consider a two parallel machine problem where one machine is not available during a time period. The unavailable time period is fixed and known in advance. A machine is not available probably because it needs preventive maintenance or periodical repair. The objective of the problem is to minimize the makespan. For both nonresumable and resumable cases, we partition the problem into four sub-problems, each of which is solved optimally by an algorithm. Although all the algorithms have exponential time complexities, they are quite efficient in solving large-sized problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 160, Issue 2, 16 January 2005, Pages 445-456
Journal: European Journal of Operational Research - Volume 160, Issue 2, 16 January 2005, Pages 445-456
نویسندگان
Ching-Jong Liao, Der-Lin Shyur, Chien-Hung Lin,