The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Multi-Objective Workflow Scheduling With Deep-Q-Network-Based Multi-Agent Reinforcement Learning
Open accessAbstract
Cloud Computing provides an effective platform for executing large-scale and complex workflow applications with a pay-as-you-go model. Nevertheless, various challenges, especially its optimal scheduling for multiple conflicting objectives, are yet to be addressed properly. The existing multi-objective workflow scheduling approaches are still limited in many ways, e.g., encoding is restricted by prior experts’ knowledge when handling a dynamic real-time problem, which strongly influences the performance of scheduling. In this paper, we apply a deep-Q-network model in a multi-agent reinforcement learning setting to guide the scheduling of multi-workflows over infrastructure-as-a-service clouds. To optimize multi-workflow completion time and user’s cost, we consider a Markov game model, which takes the number of workflow applications and heterogeneous virtual machines as state input and the maximum completion time and cost as rewards. The game model is capable of seeking for correlated equilibrium between make-span and cost criteria without prior experts’ knowledge and converges to the correlated equilibrium policy in a dynamic real-time environment. To validate our proposed approach, we conduct extensive case studies based on multiple well-known scientific workflow templates and Amazon EC2 cloud. The experimental results clearly suggest that our proposed approach outperforms traditional ones, e.g., non-dominated sorting genetic algorithm-II, multi-objective particle swarm optimization, and game-theoretic-based greedy algorithms, in terms of optimality of scheduling plans generated.
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
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353
Learning to Rank Using User Clicks and Visual Features for Image Retrieval
Yu, J., Tao, D., Wang, M., & Rui, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2336697 · Cited by 445
Optimization of global production scheduling with deep reinforcement learning
Waschneck, B., Reichstaller, A., Belzner, L., Altenmüller, T., Bauernhansl, T., Knapp, A., & Kyek, A. (2018) · Procedia CIRP · doi:10.1016/j.procir.2018.03.212 · Cited by 366
iPrivacy: Image Privacy Protection by Identifying Sensitive Objects via Deep Multi-Task Learning
Yu, J., Zhang, B., Kuang, Z., Lin, D., & Fan, J. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2636090 · Cited by 349
Computation Offloading for Service Workflow in Mobile Cloud Computing
Deng, S., Huang, L., Taheri, J., & Zomaya, A. Y. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2381640 · Cited by 276
A hybrid multi-objective Particle Swarm Optimization for scientific workflow scheduling
Verma, A., & Kaushal, S. (2017) · Parallel Computing · doi:10.1016/j.parco.2017.01.002 · Cited by 258
Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT
Zhou, X., Zhang, G., Sun, J., Zhou, J., Wei, T., & Hu, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2018.10.046 · Cited by 255
Cited by
Proceedings of the 19th Python in Science Conference
(2020) · Proceedings of the Python in Science Conference · doi:10.25080/majora-342d178e-02b · Cited by 284
A multi-objective deep reinforcement learning framework
Nguyen, T. T., Nguyen, N. D., Vamplew, P., Nahavandi, S., Dazeley, R., & Lim, C. P. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103915 · Cited by 152
Biobjective Task Scheduling for Distributed Green Data Centers
Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C. (2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2019.2958979 · Cited by 138
Distributed resource scheduling in edge computing: Problems, solutions, and opportunities
Sahni, Y., Cao, J., Yang, L., & Wang, S. (2022) · Computer Networks · doi:10.1016/j.comnet.2022.109430 · Cited by 38
Metadata
- Authors
- Wang, Y., Liu, H., Zheng, W., Xia, Y., Li, Y., Chen, P., Guo, K., & Xie, H.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 39974-39982
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2929242575
- Cited by
- 288
- References
- 24
- FWCI
- 52.80
- 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: Multi-Objective Workflow Scheduling With Deep-Q-Network-Based Multi-Agent Reinforcement Learning. https://app.cochat.ai/papers/10.1109/access.2019.2902846
- The paper
- Wang, Y., Liu, H., Zheng, W., Xia, Y., Li, Y., Chen, P., Guo, K., & Xie, H. (2019). Multi-Objective Workflow Scheduling With Deep-Q-Network-Based Multi-Agent Reinforcement Learning. IEEE Access. https://doi.org/10.1109/access.2019.2902846
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.