Scheduling and Optimization Makespan with new Metaheuristic Algorithm CSO-GA
محل انتشار: دومین همایش ملی مهندسی کامپیوتر و فناوری اطلاعات
سال انتشار: 1393
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 833
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
NCCEB02_110
تاریخ نمایه سازی: 16 خرداد 1394
چکیده مقاله:
With the advent of cloud computing technology, one of the important issues that had been raised in this debate is scheduled. The scheduling of the main challenges is to reduce Makesan. Makesan is time to finish all the tasks running. Given the number of jobs and the machines find definitive solution to this problem is difficult to be him.Find solutions to problems which are difficult to find a definitive solution or impossible for researchers over the years have been crucial . that’s name is NP-hard problems . Today, these issues metaheuristic ways to respond . this article try to describe metaheuristic algorithm and then present one of the newest metaheuristic method . that’s name is Cat Swarm Optimization ( CSO ) which is derived from the behavior of Cat’s . output CSO input to the algorithm of genetic and eventually to reach an acceptable answer This algorithm is CSO-GA . Then use it to solve challenges in scheduling and reduce makespan .
کلیدواژه ها:
نویسندگان
Shahram Rouhi
۱Islamic Azad University -Science and Research Branch of Khouzestan