The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution
Abstract
Abstract This paper presents an alternative method for cloud task scheduling problem which aims to minimize makespan that required to schedule a number of tasks on different Virtual Machines (VMs). The proposed method is based on the improvement of the Moth Search Algorithm (MSA) using the Differential Evolution (DE). The MSA simulates the behavior of moths to fly towards the source of light in nature through using two concepts, the phototaxis and Levy flights that represent the exploration and exploitation ability respectively. However, the exploitation ability is still needed to be improved, therefore, the DE can be used as local search method. In order to evaluate the performance of the proposed MSDE algorithm, a set of three experimental series are performed. The first experiment aims to compare the traditional MSA and the proposed algorithm to solve a set of twenty global optimization problems. Meanwhile, in second and third experimental series the performance of the proposed algorithm to solve the cloud task scheduling problem is compared against other heuristic and meta-heuristic algorithms for synthetical and real trace data, respectively. The results of the two experimental series show that the proposed algorithm outperformed other algorithms according to the performance measures.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Cited by
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
Abualigah, L., & Diabat, A. (2021) · Cluster Computing · doi:10.1007/s10586-020-03075-5 · Cited by 355
Houssein, 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
Chen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
Singh, H., Tyagi, S., Kumar, P., Gill, S. S., & Buyya, R. (2021) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2021.102353 · Cited by 104
Metadata
- Authors
- Elaziz, M. A., Xiong, S., Jayasena, K. P. N., & Li, L.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 169
- Pages
- 39-52
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2914250519
- Cited by
- 226
- References
- 2
- FWCI
- 39.36
- Type
- journal article
- Language
- en
- Open access
- closed
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: Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. https://app.cochat.ai/papers/10.1016/j.knosys.2019.01.023
- The paper
- Elaziz, M. A., Xiong, S., Jayasena, K. P. N., & Li, L. (2019). Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2019.01.023
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.