Author:
Jafari Navimipour Nima,Masoud Rahmani Amir,Habibizad Navin Ahmad,Hosseinzadeh Mehdi
Abstract
Purpose
– Expert Cloud as a new class of Cloud computing systems enables its users to request the skill, knowledge and expertise of people by employing internet infrastructures and Cloud computing concepts without any information of their location. Job scheduling is one of the most important issue in Expert Cloud and impacts on its efficiency and customer satisfaction. The purpose of this paper is to propose an applicable method based on genetic algorithm for job scheduling in Expert Cloud.
Design/methodology/approach
– Because of the nature of the scheduling issue as a NP-Hard problem and the success of genetic algorithm in optimization and NP-Hard problems, the authors used a genetic algorithm to schedule the jobs on human resources in Expert Cloud. In this method, chromosome or candidate solutions are represented by a vector; fitness function is calculated based on response time; one point crossover and swap mutation are also used.
Findings
– The results indicate that the proposed method can schedule the received jobs in appropriate time with high accuracy in comparison to common methods (First Come First Served, Shortest Process Next and Highest Response Ratio Next). Also the proposed method has better performance in term of total execution time, service+wait time, failure rate and Human Resource utilization rate in comparison to common methods.
Originality/value
– In this paper the job scheduling issue in Expert Cloud is pointed out and the approach to resolve the problem is applied into a practical example.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference43 articles.
1. Abdoun, O.
,
Tajani, C.
and
Abouchabaka, J.
(2012), “Analyzing the performance of mutation operators to solve the traveling salesman problem”, International Journal of Emerging Sciences, Vol. 2 No. 1, pp. 61-77.
2. Abrishami, S.
and
Naghibzadeh, M.
(2012), “Deadline-constrained workflow scheduling in software as a service cloud”, Scientia Iranica, Vol. 19 No. 3, pp. 680-689.
3. Arora, S.
,
Hazan, E.
and
Kale, S.
(2012), “The multiplicative weights update method: a meta-algorithm and applications”, Theory of Computing, Vol. 8, pp. 121-164.
4. Carro-Calvo, L.
,
Salcedo-Sanz, S.
,
Portilla-Figueras, J.A.
and
Ortiz-García, E.G.
(2010), “A genetic algorithm with switch-device encoding for optimal partition of switched industrial Ethernet networks”, Journal of Network and Computer Applications, Vol. 33 No. 4, pp. 375-382.
5. Diaz-Gomez, P.A.
and
Hougen, D.F.
(2007), “Initial population for genetic algorithms: a metric approach”, GEM, pp. 43-49.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献