Utilizing Bee Colony to Solve Task Scheduling Problem in Distributed Systems
Mostafa Haghi Kashani, Marzieh jamei, Mehdi Akbari, Rohollah Moosavi Tayebi · 2011
Tasks scheduling problem is a key factor for distributed systems to gain better performance. Even in the best conditions, the scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperform the existent GA-based method in term of Make span.