|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Scheduling independent tasks: Bee Colony Optimization approach||Journal:||2009 17th Mediterranean Conference on Control and Automation||First page:||10777008||Conference:||17th Mediterranean Conference on Control and Automation; Thessaloniki, Greece; 24-26 June 2009||Issue Date:||2009||Rank:||M30||ISBN:||978-1-4244-4684-1||DOI:||10.1109/MED.2009.5164680||Abstract:||
The problem of static scheduling of independent tasks on homogeneous multiprocessor systems is studied in this paper. The problem is solved by the bee colony optimization (BCO). The BCO algorithm belongs to the class of stochastic swarm optimization methods. The proposed algorithm is inspired by the foraging habits of bees in the nature. The BCO algorithm was able to obtain the optimal value of objective function in all small to medium size test problems. The CPU times required to find the best solutions by the BCO are acceptable.
|Keywords:||Processor scheduling | Multiprocessing systems | Testing | Scheduling algorithm | Insects | Recruitment | Space exploration | Automatic control | Automation | Stochastic processes||Publisher:||IEEE|
Show full item record
checked on Mar 23, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.