The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT
Abstract
Abstract More and more enterprises and communities choose cloud computing platforms to deploy their commercial or scientific workflow applications along with the increasing popularity of pay-as-you-go cloud services. A major task of cloud service providers is to minimize the monetary cost and makespan of executing workflows in the Infrastructure as a Service (IaaS) cloud. Most of the existing techniques for cost and makespan minimization are designed for traditional computing platforms which cannot be applied to the cloud computing platforms with unique service-based resource managing methods and pricing strategies. In this paper, we study the joint optimization of cost and makespan of scheduling workflows in IaaS clouds, and propose a novel workflow scheduling scheme. In this scheme, a fuzzy dominance sort based heterogeneous earliest-finish-time (FDHEFT) algorithm is developed which closely integrates the fuzzy dominance sort mechanism with the list scheduling heuristic HEFT. Extensive experiments using the real-world and synthetic workflows demonstrate the efficacy of our scheme. Our scheme can achieve significantly better cost-makespan tradeoff fronts with remarkably higher Hypervolume and can run up to hundreds of times faster than the state-of-the-art algorithms.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Performance-effective and low-complexity task scheduling for heterogeneous computing
Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.993206 · Cited by 3,475
jMetal: A Java framework for multi-objective optimization
Durillo, J. J., & Nebro, A. J. (2011) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2011.05.014 · Cited by 1,134
Characterizing and profiling scientific workflows
Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., & Vahi, K. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.015 · Cited by 788
Evolutionary Multi-Objective Workflow Scheduling in Cloud
Zhu, Z., Zhang, G., Li, M., & Liu, X. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2446459 · Cited by 401
Self-citationMulti-objective workflow scheduling in Amazon EC2
Durillo, J. J., & Prodan, R. (2014) · Cluster Computing · doi:10.1007/s10586-013-0325-0 · Cited by 173
Cost-efficient task scheduling for executing large programs in the cloud
Su, S., Li, J., Huang, Q., et al. (2013) · Parallel Computing · doi:10.1016/j.parco.2013.03.002 · Cited by 167
A Budget Constrained Scheduling Algorithm for Workflow Applications
Arabnejad, H., & Barbosa, J. G. (2014) · Journal of Grid Computing · doi:10.1007/s10723-014-9294-7 · Cited by 151
Energy-aware virtual machine allocation for cloud with resource reservation
Zhang, X., Wu, T., Chen, M., Wei, T., Zhou, J., Hu, S., & Buyya, R. (2018) · Journal of Systems and Software · doi:10.1016/j.jss.2018.09.084 · Cited by 134
Self-citation
Cited by
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
Multi-Objective Workflow Scheduling With Deep-Q-Network-Based Multi-Agent Reinforcement Learning
Wang, Y., Liu, H., Zheng, W., Xia, Y., Li, Y., Chen, P., Guo, K., & Xie, H. (2019) · IEEE Access · doi:10.1109/access.2019.2902846 · Cited by 288
Liu, X., Yang, J., Zou, C., Chen, Q., Yan, X., Chen, Y., & Cai, C. (2022) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3059318 · Cited by 79
Metadata
- Authors
- Zhou, X., Zhang, G., Sun, J., Zhou, J., Wei, T., & Hu, S.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 93
- Pages
- 278-289
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W2898726528
- Cited by
- 255
- References
- 12
- FWCI
- 47.00
- 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: Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT. https://app.cochat.ai/papers/10.1016/j.future.2018.10.046
- The paper
- Zhou, X., Zhang, G., Sun, J., Zhou, J., Wei, T., & Hu, S. (2019). Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.10.046
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.