期刊名称:Journal of Theoretical and Applied Information Technology
印刷版ISSN:1992-8645
电子版ISSN:1817-3195
出版年度:2011
卷号:33
期号:2
页码:155-164
出版社:Journal of Theoretical and Applied
摘要:Scheduling jobs on computational grids is identified as NP-complete problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. This paper presents a novel metaheuristics method based on Firefly Algorithm (FA) for scheduling jobs on grid computing. The proposed method is to dynamically create an optimal schedule to complete the jobs within minimum makespan. The proposed method is compared with other heuristic methods using simple and different simulation scenarios. The results show that, the firefly scheduling mechanism is more efficient than Min-Min and Max-Min heuristics in many scheduling scenarios.