The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
A review of metaheuristic scheduling techniques in cloud computing
Open accessAbstract
Cloud computing has become a buzzword in the area of high performance distributed computing as it provides on-demand access to shared pool of resources over Internet in a self-service, dynamically scalable and metered manner. Cloud computing is still in its infancy, so to reap its full benefits, much research is required across a broad array of topics. One of the important research issues which need to be focused for its efficient performance is scheduling. The goal of scheduling is to map tasks to appropriate resources that optimize one or more objectives. Scheduling in cloud computing belongs to a category of problems known as NP-hard problem due to large solution space and thus it takes a long time to find an optimal solution. There are no algorithms which may produce optimal solution within polynomial time to solve these problems. In cloud environment, it is preferable to find suboptimal solution, but in short period of time. Metaheuristic based techniques have been proved to achieve near optimal solutions within reasonable time for such problems. In this paper, we provide an extensive survey and comparative analysis of various scheduling algorithms for cloud and grid environments based on three popular metaheuristic techniques: Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), and two novel techniques: League Championship Algorithm (LCA) and BAT algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Beloglazov, A., Abawajy, J., & Buyya, R. (2012) · Future Generation Computer Systems · doi:10.1016/j.future.2011.04.017 · Cited by 2,761
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
Braun, T. D., Siegel, H. J., Beck, N., Bölöni, L. L., Maheswaran, M., Reuther, A. I., Robertson, J. P., Theys, M. D., Yao, B., Hensgen, D., et al. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1714 · Cited by 1,722
Pandey, S., Wu, L., Guru, S. M., & Buyya, R. (2010) · 2010 24th IEEE International Conference on Advanced Information Networking and Applications · doi:10.1109/aina.2010.31 · Cited by 880
Deadline Based Resource Provisioningand Scheduling Algorithm for Scientific Workflows on Clouds
Rodriguez, M. A., & Buyya, R. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2314655 · Cited by 686
Cloud Task Scheduling Based on Load Balancing Ant Colony Optimization
Li, K., Xu, G., Zhao, G., Dong, Y., & Wang, D. (2011) · 2011 Sixth Annual Chinagrid Conference · doi:10.1109/chinagrid.2011.17 · Cited by 408
Cited by
Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems
Joseph, S. B., Dada, E. G., Abidemi, A., Oyewola, D. O., & Khammas, B. M. (2022) · Heliyon · doi:10.1016/j.heliyon.2022.e09399 · Cited by 458
A comprehensive survey for scheduling techniques in cloud computing
Kumar, M., Sharma, S. C., Goel, A., & Singh, S. P. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2019.06.006 · Cited by 364
Self-citationHoussein, E. H., Gad, A. G., Wazery, Y. M., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100841 · Cited by 355
A Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
Sharma, M., & Kaur, P. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09412-6 · Cited by 303
Issues and Challenges of Load Balancing Techniques in Cloud Computing: A Survey
Kumar, P., & Kumar, R. (2019) · ACM Computing Surveys · doi:10.1145/3281010 · Cited by 276
Metadata
- Authors
- Kalra, M., & Singh, S.
- Venue
- Egyptian Informatics Journal
- Publisher
- Elsevier BV
- Published
- 2015-11
- Volume
- 16
- Issue
- 3
- Pages
- 275-295
- ISSN
- 1110-8665 (ISSN-L)
- OpenAlex
- W1120107613
- Cited by
- 409
- References
- 56
- FWCI
- 87.39
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A review of metaheuristic scheduling techniques in cloud computing. https://app.cochat.ai/papers/10.1016/j.eij.2015.07.001
- The paper
- Kalra, M., & Singh, S. (2015). A review of metaheuristic scheduling techniques in cloud computing. Egyptian Informatics Journal. https://doi.org/10.1016/j.eij.2015.07.001
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.