Authors: Davidović, Tatjana 
Šelmić, Milica
Teodorović, Dušan
Ramljak, Dušan
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Bee colony optimization for scheduling independent tasks to identical processors
Journal: Journal of Heuristics
Volume: 18
Issue: 4
First page: 549
Last page: 569
Issue Date: 1-Aug-2012
Rank: M21
ISSN: 1381-1231
DOI: 10.1007/s10732-012-9197-3
Abstract: 
The static scheduling of independent tasks on homogeneous multiprocessor systems is studied in this paper. This problem is treated by the Bee Colony Optimization (BCO) meta-heuristic. The BCO algorithm belongs to the class of stochastic swarm optimization methods inspired by the foraging habits of bees in nature. To investigate the performance of the proposed method extensive numerical experiments are performed. Our BCO algorithm is able to obtain the optimal value of the objective function in the majority of test examples known from literature. The deviation of non-optimal solutions from the optimal ones in our test examples is at most 2%. The CPU times required to find the best solutions by BCO are significantly smaller than the corresponding times required by the CPLEX optimization solver. Moreover, our BCO is competitive with state-of-the-art methods for similar problems, with respect to both solution quality and running time. The stability of BCO is examined through multiple executions and it is shown that solution deviation is less than 1%.
Keywords: Bee colony optimization (BCO) | Combinatorial optimization | Homogeneous multiprocessor systems | Scheduling problems | Swarm intelligence
Publisher: Springer Link
Project: Matematički modeli i metode optimizacije sa primenama, 144007
Upravljanje saobraćajem i transportom primenom modela zasnovanih na metodama matematičkog programiranja i mekog računa, 144033

Show full item record

SCOPUSTM   
Citations

41
checked on Aug 18, 2022

Page view(s)

21
checked on Aug 18, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.