کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
461932 | 696649 | 2010 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A novel global harmony search algorithm for task assignment problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A novel global harmony search algorithm for task assignment problem A novel global harmony search algorithm for task assignment problem](/preview/png/461932.png)
چکیده انگلیسی
The objective of task assignment problem (TAP) is to minimize the sum of interprocessor communication and task processing costs for a distributed system which subjects to several resource constraints. We use a novel global harmony search algorithm (NGHS) to solve this problem, and the NGHS algorithm has demonstrated higher efficiency than the improved harmony search algorithm (IHS) on finding the near optimal task assignment. We also devise a new method called normalized penalty function method to tradeo® the costs and the constraints. A large number of experiments show that our algorithm performs well on finding the near optimal task assignment, and it is a viable approach for the task assignment problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Systems and Software - Volume 83, Issue 10, October 2010, Pages 1678–1688
Journal: Journal of Systems and Software - Volume 83, Issue 10, October 2010, Pages 1678–1688
نویسندگان
Dexuan Zou, Liqun Gao, Steven Li, Jianhua Wu, Xin Wang,