Ant algorithm for grid scheduling powered by local search.

Kousalya, K.; Balasubramanie, P.

International Journal of Open Problems in Computer Science and Mathematics. IJOPCM (2008)

  • Volume: 1, Issue: 3, page 222-240
  • ISSN: 1998-6262

How to cite

top

Kousalya, K., and Balasubramanie, P.. "Ant algorithm for grid scheduling powered by local search.." International Journal of Open Problems in Computer Science and Mathematics. IJOPCM 1.3 (2008): 222-240. <http://eudml.org/doc/232981>.

@article{Kousalya2008,
author = {Kousalya, K., Balasubramanie, P.},
journal = {International Journal of Open Problems in Computer Science and Mathematics. IJOPCM},
keywords = {computational grid; scheduling algorithm; heuristic approach; ant algorithm; simulation},
language = {eng},
number = {3},
pages = {222-240},
publisher = {Irbid National University, Irbid},
title = {Ant algorithm for grid scheduling powered by local search.},
url = {http://eudml.org/doc/232981},
volume = {1},
year = {2008},
}

TY - JOUR
AU - Kousalya, K.
AU - Balasubramanie, P.
TI - Ant algorithm for grid scheduling powered by local search.
JO - International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
PY - 2008
PB - Irbid National University, Irbid
VL - 1
IS - 3
SP - 222
EP - 240
LA - eng
KW - computational grid; scheduling algorithm; heuristic approach; ant algorithm; simulation
UR - http://eudml.org/doc/232981
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.