Optimal job scheduling in grid computing using efficient binary artificial bee colony optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86089347" target="_blank" >RIV/61989100:27240/13:86089347 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00500-012-0957-7" target="_blank" >http://dx.doi.org/10.1007/s00500-012-0957-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-012-0957-7" target="_blank" >10.1007/s00500-012-0957-7</a>
Alternative languages
Result language
angličtina
Original language name
Optimal job scheduling in grid computing using efficient binary artificial bee colony optimization
Original language description
The artificial bee colony has the advantage of employing fewer control parameters compared with other population-based optimization algorithms. In this paper a binary artificial bee colony (BABC) algorithm is developed for binary integer job scheduling problems in grid computing. We further propose an efficient binary artificial bee colony extension of BABC that incorporates a flexible ranking strategy (FRS) to improve the balance between exploration and exploitation. The FRS is introduced to generate and use new solutions for diversified search in early generations and to speed up convergence in latter generations. Two variants are introduced to minimize the makepsan. In the first a fixed number of best solutions is employed with the FRS while in thesecond the number of the best solutions is reduced with each new generation. Simulation results for benchmark job scheduling problems show that the performance of our proposed methods is better than those alternatives such as genetic algo
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Soft computing
ISSN
1432-7643
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
5
Country of publishing house
US - UNITED STATES
Number of pages
16
Pages from-to
867-882
UT code for WoS article
000317786400011
EID of the result in the Scopus database
—