Optimal job scheduling in grid computing using efficient binary artificial bee colony optimization

Soft Computing

Volumn 17, Issue 5, 2013, Pages 867-882

  Kim, Sung Soo ^a   Byeon, Ji Hwan ^a   Liu, Hongbo ^b,c   Abraham, Ajith ^d,e   McLoone, Seán ^f  

^a Kangwon National University   (South Korea)

^b DALIAN MARITIME UNIVERSITY   (China)

^c UNIVERSITY OF CALIFORNIA SAN DIEGO   (United States)

^d SCIENTIFIC NETWORK FOR INNOVATION AND RESEARCH EXCELLENCE   (United States)

^e VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^f NATIONAL UNIVERSITY OF IRELAND   (Ireland)

Author keywords

Artificial bee colony (ABC); Binary artificial bee colony (BABC); Efficient binary artificial bee colony (EBABC); Flexible ranking strategy (FRS); Grid computing; Job scheduling

Indexed keywords

BENCHMARKING; GENETIC ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING; SIMULATED ANNEALING;

ARTIFICIAL BEE COLONIES; ARTIFICIAL BEE COLONIES (ABC); ARTIFICIAL BEE COLONY OPTIMIZATIONS; EXPLORATION AND EXPLOITATION; JOB SCHEDULING; JOB SCHEDULING PROBLEM; POPULATION-BASED OPTIMIZATION; RANKING STRATEGY;

GRID COMPUTING;

EID: 84876301601     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-012-0957-7     Document Type: Article

References (70)

1. Abraham A, Buyya R, Nath B (2000) Nature's heuristics for scheduling jobs on computational grids. In: The 8th IEEE international conference on advanced computing and communications (ADCOM 2000), pp 45-52.
2. Abraham A, Liu H, Zhao M (2008) Particle swarm scheduling for work-flow applications in distributed computing environments. Metaheuristics for scheduling in industrial and manufacturing applications. Stud Comput Intell 128: 327-342.
3. Abraham A, Jatoth R, Rajasekhar A (2012) Hybrid differential artificial bee colony algorithm. J Comput Theor Nanosci 9(2): 249-257.
4. Alzaqebah M, Abdullah S (2011) Comparison on the selection strategies in the artificial bee colony algorithm for examination timetabling problems. Int J Soft Comput Eng 1: 158-163.
5. Banks A, Vincent J, Phalp K (2009) Natural strategies for search. Nat Comput 8(3): 547-570.
6. Bao L, Zeng J (2009) Comparison and analysis of the selection mechanism in the artificial bee colony algorithm. In: Ninth international conference on hybrid intelligent systems, 2009, HIS'09, vol 1. IEEE, pp 411-416.
7. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, Oxford.
8. Braun T, Siegel H, Beck N, Boloni L, Maheswaran M, Reuther A, Robertson J, Theys M, Yao B (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61(6): 810-837.
9. Brucker P (2007) Scheduling algorithms. Springer, Berlin.
10. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Comput Lett 45(4): 369-375.
11. Chandrasekaran K, Hemamalini S, Simon S, Padhy N (2012) Thermal unit commitment using binary/real coded artificial bee colony algorithm. Electric Power Syst Res 84(1): 109-119.
12. Chung K, Erdös P (1952) On the application of the Borel-Cantelli lemma. Trans Am Math Soc 72: 179-186.
13. Chung W, Chang R (2009) A new mechanism for resource monitoring in grid computing. Future Gen Comput Syst 25(1): 1-7.
14. Clerc M (2006) Particle swarm optimization. Wiley-ISTE.
15. Cuevas E, Sención-Echauri F, Zaldivar D, Pérez-Cisneros M (2012) Multi-circle detection on images using artificial bee colony (abc) optimization. Soft Comput 16(2): 1-16.
16. Davidovic T, Selmic M, Teodorovic D (2009) Scheduling independent tasks: bee colony optimization approach. In: 17th Mediterranean conference on control and automation, 2009, MED'09. IEEE, pp 1020-1025.
17. Davis R, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surveys 43(4): 35.
18. Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1: 3-18.
19. Di Martino V, Mililotti M (2004) Sub optimal scheduling in a grid using genetic algorithms. Parallel Comput 30(5-6): 553-565.
20. Dong F Akl S (2006) Scheduling algorithms for grid computing: state of the art and open problems. Technical report, School of Computing, Queen's University, Kingston, Ontario.
21. Forestiero A, Mastroianni C, Spezzano G (2008) So-grid: a self-organizing grid featuring bio-inspired algorithms. ACM Trans Auton Adapt Syst 3(2): 1-37.
22. Foster I, Kesselman C (2004) The grid: blueprint for a new computing infrastructure. Morgan Kaufmann.
23. Foster I, Zhao Y, Raicu I, Lu S (2008) Cloud computing and grid computing 360-degree compared. In: Grid computing environments workshop, 2008, GCE'08. IEEE, pp 1-10.
24. Fujita S, Yamashita M (2000) Approximation algorithms for multiprocessor scheduling problem. IEICE Trans Inf Syst 83(3): 503-509.
25. Gao Y, Rong H, Huang J (2005) Adaptive grid job scheduling with genetic algorithms. Future Gen Comput Syst 21(1): 151-161.
26. García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cecn2005 special session on real parameter optimization. J Heuristics 15(6): 617-644.
27. Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co.
28. Guo C, Tang H (2001) Global convergence properties of evolution stragtegies. Math Numer Sin 23(1): 105-110.
29. Han L, Berry D (2008) Semantic-supported and agent-based decentralized grid resource discovery. Future Gen Comput Syst 24(8): 806-812.
30. He R, Wang Y, Wang Q, Zhou J, Hu C (2005) Improved particle swarm optimization based on self-adaptive escape velocity. Chin J Softw 16(12): 2036-2044.
31. Hou E, Ansari N, Ren H (1994) A genetic algorithm for multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 5(2): 113-120.
32. Izakian H, Ladani B, Abraham A, Snášel V (2010) A discrete particle swarm optimization approach for grid job scheduling. Int J Innov Comput Inf Control 6: 1-15.
33. Jansen K, Mastrolilli M, Solis-Oba R (2000) Approximation algorithms for flexible job shop problems. In: Lecture notes in computer science. LATIN 2000: theoretical informatics, vol 1776, pp 68-77.
34. Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1): 108-132.
35. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Global Optim 39(3): 459-471.
36. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8(1): 687-697.
37. Kennedy J, Eberhart R, Shi Y (2001) Swarm intelligence. Springer, Germany.
38. Kruskal W, Wallis W (1952) Use of ranks in one-criterion variance analysis. J Am Stat Assoc 47: 583-621.
39. Laalaoui Y, Drias H (2010) Aco approach with learning for preemptive scheduling of real-time tasks. Int J Bio-Inspired Comput 2(6): 383-394.
40. Lahoz-Beltra R, Perales-Gravan C (2010) A survey of nonparametric tests for the statistical analysis of evolutionary computational experiments. Int J Inf Theor Appl 17(1): 41-61.
41. Lee W, Cai W (2011) A novel artificial bee colony algorithm with diversity strategy. In: 2011 Seventh international conference on natural computation (ICNC), vol 3. IEEE, pp 1441-1444.
42. Li J, Pan Q, Xie S, Wang S (2011) A hybrid artificial bee colony algorithm for flexible job shop scheduling problems. Int J Comput Commun Control 6(2): 286-296.
43. Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1): 320-332.
44. Liu H, Abraham A, Clerc M (2007) Chaotic dynamic characteristics in swarm intelligence. Appl Soft Comput 7(3): 1019-1026.
45. Liu H, Abraham A, Wang Z (2009) A multi-swarm approach to multi-objective flexible job-shop scheduling problems. Fundam Inf 95(4): 465-489.
46. Liu H, Abraham A, Hassanien A (2010) Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm. Future Gen Comput Syst 26(8): 1336-1343.
47. Ma M, Liang J, Guo M, Fan Y, Yin Y (2011) Sar image segmentation based on artificial bee colony algorithm. Appl Soft Comput 11(8): 5205-5214.
48. Mann H, Whitney D (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1): 50-60.
49. Mastrolilli M, Gambardella L (1999) Effective neighborhood functions for the flexible job shop problem. J Sched 3(1): 3-20.
50. Mezura-Montes E, Velez-Koeppel R (2010) Elitist artificial bee colony for constrained real-parameter optimization. In: 2010 IEEE Congress on evolutionary computation (CEC). IEEE, pp 1-8.
51. Nemeth Z, Sunderam V (2003) Characterizing grids: attributes, definitions, and formalisms. J Grid Comput 1(1): 9-23.
52. Pampara G, Engelbrecht A (2011) Binary artificial bee colony optimization. In: Proceedings of 2011 IEEE symposium on swarm intelligence (SIS). IEEE, pp 1-8.
53. Pan Q, Fatih Tasgetiren M, Suganthan P, Chua T (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181(12): 2455-2468.
54. Pinedo M (2012) Scheduling: theory, algorithms, and systems. Springer, Berlin.
55. Ritchie G, Levine J (2003) A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. Technical report, Centre for Intelligent Systems and their Applications, University of Edinburgh.
56. Ritchie G, Levine J (2004) A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. In: Proceedings of 23rd workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG 2004.
57. Sharma T, Pant M (2011) Enhancing the food locations in an artificial bee colony algorithm. In: 2011 IEEE symposium on swarm intelligence (SIS). IEEE, pp 1-5.
58. Singh A, Sundar S (2011) An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput 15(12): 1-11.
59. Su M, Su S, Zhao Y (2009) A swarm-inspired projection algorithm. Pattern Recogn Lett 42(11): 2764-2786.
60. Thesen A (1998) Design and evaluation of tabu search algorithms for multiprocessor scheduling. J Heuristics 4(2): 141-160.
61. Vivekanandan K, Ramyachitra D, Anbu B (2011) Artificial bee colony algorithm for grid scheduling. J Converg Inf Technol 6: 328-339.
62. Walker R (2007) Purposive behavior of honeybees as the basis of an experimental search engine. Soft Comput 11(8): 697-716.
63. Wei Y, Blake M (2010) Service-oriented computing and cloud computing: challenges and opportunities. IEEE Internet Comput 14(6): 72-75.
64. Wong L, Puan C, Low M, Wong Y (2010) Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems. Int J Bio-Inspired Comput 2(2): 85-99.
65. Wu A, Yu H, Jin S, Lin K, Schiavone G (2004) An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 15(9): 824-834.
66. Xhafa F, Carretero J, Abraham A (2007) Genetic algorithm based schedulers for grid computing systems. Int J Innov Comput Inf Control 3(5): 1-19.
67. Xiao R, Chen W, Chen T (2012) Modeling of ant colony's labor division for the multi-project scheduling problem and its solution by pso. J Comput Theor Nanosci 9(2): 223-232.
68. Yang X (2011) Nature-inspired metaheuristic algorithms. Luniver Press.
69. Yue B, Liu H, Abraham A (2012) Dynamic trajectory and convergence analysis of swarm algorithm. Comput Inf 31(2): 371-392.
70. Ziarati K, Akbari R, Zeighami V (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput 11: 3720-3733.