文章基本信息

标题：Using Bee Colony Optimization to Solve the Task Scheduling Problem in Homogenous Systems
本地全文：下载
作者：Vahid Arabnejad ; Ali Moeini ; Nasrollah Moghadam 等
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2011
卷号：8
期号：5
出版社：IJCSI Press
摘要：Bee colony optimization (BCO) is one of the most recent algorithms in swarm intelligence that can be used in optimization problems this algorithm is based on the intelligent behavior of honey bees in foraging process. In this paper bee colony optimization is applied to solve the task scheduling problem which tasks have dependency with each other. Scheduling of tasks that represents by directed acyclic graph is a NP-complete problem. The main purpose of this problem is obtaining the minimum schedule length that is called make-span. To realize the performance of BCO in this problem, the obtained results are presented and compared with the most successful methods such as Ant colony system, Tabu search and simulate annealing. The comparison shows that BCO produces the solutions in a different way and it is still among the bests.
关键词：Bee Colony Optimization; Task Graph; Task Scheduling Problem; Homogenous Processors