کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
473934 | 698825 | 2009 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A note: Simple heuristics for scheduling a maintenance activity on unrelated machines
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A note: Simple heuristics for scheduling a maintenance activity on unrelated machines A note: Simple heuristics for scheduling a maintenance activity on unrelated machines](/preview/png/473934.png)
چکیده انگلیسی
Following several recent papers discussing various problems of scheduling a maintenance activity, we focus here on scheduling a maintenance activity on unrelated parallel machines. The objective is to minimize flow-time. In the basic setting, we assume that all the machines must be maintained simultaneously. The problem is known to be NP-hard, and we introduce and test numerically an efficient heuristic and a lower bound, both based on a solution of a matching problem. We also study the relaxed version, where the machines are not restricted to be maintained at the same time. Similar heuristic and lower bound are proposed and tested.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 10, October 2009, Pages 2759–2762
Journal: Computers & Operations Research - Volume 36, Issue 10, October 2009, Pages 2759–2762
نویسندگان
Gur Mosheiov, Assaf Sarig,