The DOI matches its Crossref record; 47 of the 49 references it cites were found in a registry or an index.
Biobjective Task Scheduling for Distributed Green Data Centers
Abstract
The industry of data centers is the fifth largest energy consumer in the world. Distributed green data centers (DGDCs) consume 300 billion kWh per year to provide different types of heterogeneous services to global users. Users around the world bring revenue to DGDC providers according to actual quality of service (QoS) of their tasks. Their tasks are delivered to DGDCs through multiple Internet service providers (ISPs) with different bandwidth capacities and unit bandwidth price. In addition, prices of power grid, wind, and solar energy in different GDCs vary with their geographical locations. Therefore, it is highly challenging to schedule tasks among DGDCs in a high-profit and high-QoS way. This work designs a multiobjective optimization method for DGDCs to maximize the profit of DGDC providers and minimize the average task loss possibility of all applications by jointly determining the split of tasks among multiple ISPs and task service rates of each GDC. A problem is formulated and solved with a simulated-annealing-based biobjective differential evolution (SBDE) algorithm to obtain an approximate Pareto-optimal set. The method of minimum Manhattan distance is adopted to select a knee solution that specifies the Pareto-optimal task service rates and task split among ISPs for DGDCs in each time slot. Real-life data-based experiments demonstrate that the proposed method achieves lower task loss of all applications and larger profit than several existing scheduling algorithms. Note to Practitioners-This work aims to maximize the profit and minimize the task loss for DGDCs powered by renewable energy and smart grid by jointly determining the split of tasks among multiple ISPs. Existing task scheduling algorithms fail to jointly consider and optimize the profit of DGDC providers and QoS of tasks. Therefore, they fail to intelligently schedule tasks of heterogeneous applications and allocate infrastructure resources within their response time bounds. In this work, a new method that tackles drawbacks of existing algorithms is proposed. It is achieved by adopting the proposed SBDE algorithm that solves a multiobjective optimization problem. Simulation experiments demonstrate that compared with three typical task scheduling approaches, it increases profit and decreases task loss. It can be readily and easily integrated and implemented in real-life industrial DGDCs. The future work needs to investigate the real-time green energy prediction with historical data and further combine prediction and task scheduling together to achieve greener and even net-zero-energy data centers.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Zhang, Y., Gong, D., & Cheng, J. (2015) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2476796 · Cited by 381
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2592479 · Cited by 374
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. L. (2019) · IEEE Access · doi:10.1109/access.2019.2902846 · Cited by 297
Lyden, S., & Haque, M. E. (2015) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2015.2468592 · Cited by 252
Survey of Techniques and Architectures for Designing Energy-Efficient Data Centers
Shuja, J., Bilal, K., Madani, S. A., Othman, M., Ranjan, R. K., Balaji, P., & Khan, S. U. (2014) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2315823 · Cited by 218
Baccarelli, E., Cordeschi, N., Mei, A., Panella, M., Shojafar, M., & Stefa, J. (2016) · IEEE Network · doi:10.1109/mnet.2016.7437025 · Cited by 200
Chiu, W.-Y., Yen, G. G., & Juan, T.-K. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2564158 · Cited by 197
Population topologies for particle swarm optimization and differential evolution
Lynn, N., Ali, M. Z., & Suganthan, P. N. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.11.002 · Cited by 187
Robust Energy Management System for a Microgrid Based on a Fuzzy Prediction Interval Model
Valencia, F., Collado, J., Sáez, D. A., & Marín, L. G. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2463079 · Cited by 175
Beloglazov, A., & Buyya, R. (2014) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.3314 · Cited by 172
Research works printed but not linked: 1
- juarez, 2018, Energy-aware scheduler for HPC parallel task base applications in cloud computing, Int J Combinat Optim Problems Inform, 9, 54
Cited by
Sorted by citations
Items 101–138 of 138
Bi-objective Intelligent Task Scheduling for Green Clouds with Deep Learning-based Prediction
Liu, H., Zhang, X., Bi, J., Yuan, H., & Zhou, M. (2020) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc48988.2020.9238050 · Cited by 4
“In this work, a bi-objective optimization method is adopted to verify the accuracy of green energy prediction data [29].”
MethodSelf-citationExtension of Stochastic Point Location for Multimodal Problems
Zhang, J., Qiu, P., & Zhou, M. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3119591 · Cited by 3
Self-citationThe Optimal Pricing Strategy of Online Products Based on Anchoring Effect
Liu, X., Zhang, Y., Qi, W., Guo, X., & Qi, L. (2020) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc42975.2020.9283221 · Cited by 3
Scheduling a Permutation Flow Shop in the Context of Industry 4.0
Fu, Y., Hou, Y., Guo, X., Qi, L., & Wang, H. (2022) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc55942.2022.10004121 · Cited by 3
“; and 3) We should explore the use of simulated annealing and other mechanisms [27] in h-SFLA to further enhance its optimization ability.”
BackgroundBenefit Maximization or the-Quality-First? An E-CARGO Perspective on the Logistics Chain
Chen, J., Zhu, H., & Liu, D. (2025) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2025.3571717 · Cited by 2
“Based on Table III, the L vector is [51, 59, 54, 53, 42, 55, 44, 55, 50, 54, 51, 45, 41, 50, 49, 40, 52, 48, 55, 39].”
AQESF: An adaptive QoS-enhanced scheduling framework for online batch of task scheduling
Huang, H., Lin, W., Xu, M., & Li, K. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.108174 · Cited by 3
Ahmed, K. M. U., Bollen, M., & Alvarez, M. (2022) · IEEE Transactions on Sustainable Computing · doi:10.1109/tsusc.2022.3216350 · Cited by 2
“The adaptive allocation of the computational capacity in the data centers has been addresses adequately in research to satisfy the performance criteria like SLA in [21], [22], [23], [24], [25], [26], [27], [28].”
MethodZhao, J., Xia, Y., Sun, X., Long, T., Peng, Q., Guo, S., Meng, F., Dong, Y., & Xia, Q. (2024) · Wireless Networks · doi:10.1007/s11276-024-03820-3 · Cited by 2
“They also proposed an optimized scheduling scheme for tasks executed on heterogeneous servers in DCs. Yuan et al. [38] considered the energy consumption of tasks executed in DCs and the bandwidth costs and limitations imposed by various Internet service providers.”
Barredo, P., & Puente, J. (2025) · Natural Computing · doi:10.1007/s11047-025-10023-y · Cited by 2
“These include Evolutionary Algorithms Cao et al. (2023), such as the approach by Cao et al., which minimises both cost and energy consumption, Simulated Annealing Yuan et al. (2021), which optimise cost and user QoS, or Ant Colony Optimisation such as Liu et al. (2023) optimising energy.”
Yuan, G., Yang, Y., Tian, G., & Fathollahi‐Fard, A. M. (2021) · Research Square · doi:10.21203/rs.3.rs-1075510/v1 · Cited by 2
Janakiraman, S., & Priya, M. D. (2023) · doi:10.1002/9781119842026.ch4 · Cited by 2
Ammari, A. C. (2023) · Elsevier eBooks · doi:10.1016/b978-0-443-18439-0.00008-2 · Cited by 1
Self-citationBulut sistemlerinde toplam tamamlanma ve enerji tabanlı sanal makine çizelgelemesi
Kızıl, A., & Karabulut, K. (2024) · Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi · doi:10.17341/gazimmfd.1202336 · Cited by 1
A critical review on optimal scheduling of hybrid renewable energy systems
Gao, X., Wang, H. F., Ma, C., Liu, M., Qi, W., Yang, X., Yao, Y., Liu, Y., Lian, J., & Wang, Z. (2025) · Sustainable Energy Technologies and Assessments · doi:10.1016/j.seta.2025.104737 · Cited by 1
Joint Optimization of Order Sequencing and Temporary Rack Shelving for Separated Bin-Picking Systems
Zheng, M., Xu, Z., Huang, E., Xia, T., & Wu, K. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3613008 · Cited by 1
“The simulated annealing mechanism is adopted in the process of searching in the proposed LNS since the mechanism is widely applied in task scheduling [58], [59] to solve problems with a large solution space.”
Efficient Cloud Clustering Schemes: A Review
Kumar, L., Tyagi, N., & Gupta, S. (2022) · International Conference on Innovative Sustainable Computational Technologies (CISCT) · doi:10.1109/cisct55310.2022.10046545 · Cited by 1
“Modifying the IWD algorithm's probability function to reduce the makespan was the primary goal of research in [47].”
MethodBai, M., Zhu, R., Guo, J., Wang, F., Wang, L., Zhu, H., Huang, L., & Zhang, Y. (2023) · IEEE Access · doi:10.1109/access.2023.3323930 · Cited by 1
“Of course, intelligent routing [11], [12], energy recovery [13], [14], and the adoption of green energy [15] and other technologies have also become the hot direction of scholars’ attention.”
BackgroundFu, Y., Wang, J., Lu, L., Tang, Q., & Zhang, S. (2024) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2300156 · Cited by 1
“As for the multi-objective optimization among multiple resource providers, Yuan et al. (2021) proposed a simulated-annealing-based biobjective differential evolution algorithm to obtain an approximate Pareto optimal set to maximize the profit and minimize the task loss for data centers powered by…”
MethodDistributed Unmanned Aerial Vehicle Cluster Testing Method Based on Deep Reinforcement Learning
Li, D., & Yang, P. (2024) · Applied Sciences · doi:10.3390/app142311282 · Cited by 1
“Yuan et al. [19] proposed a two-objective differential evolution algorithm based on simulated annealing and solved it mathematically to obtain an approximate Pareto optimal set.”
Optimizing Cloud Computing Task Schedules Through Advanced Intelligent Optimization Methods
Ammari, A. C., Al‐Hmouz, R., Khriji, L., & Zhou, M. (2025) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-4784-9_32 · Cited by 1
Self-citationGreen data centers for sustainable environment
Khan, F. (2025) · AIP conference proceedings · doi:10.1063/5.0258841 · Cited by 1
Accurate Latent Factor Analysis via Particle Swarm Optimizers
Chen, J., Luo, X., & Zhou, M. (2021) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc52423.2021.9659218 · Cited by 1
“improved by adopting more advanced evolution algorithms [31-37].”
MethodSelf-citationWang, J., Gong, B., Liu, H., & Li, S. (2021) · IEEE Access · doi:10.1109/access.2021.3049237
“Although with many achievements in homogeneous scheduling, meta-heuristics algorithms are underperforming in the nonlinear heterogeneous green scheduling, with the balance conflict between convergence and distribution [4]–[6].”
BackgroundAn Improved Energy-Efficient Hybrid Framework Eehf – Algorithm for Green Cloud Computing
Sangeetha, M., & Arun, R. (2021) · Journal of University of Shanghai for Science and Technology · doi:10.51201/jusst/21/05206
2021 Index IEEE Transactions on Automation Science and Engineering Vol. 18
(2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2021.3120615
Huang, R., Pan, C., & Tian, S. (2021) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc52481.2021.9702179
Combination of one or more characteristics framework for optimizing energy in cloud computing
Muthusankar, D., Dhanaprakash, V., & Kavin, K. (2022) · International Journal of Health Sciences · doi:10.53730/ijhs.v6ns5.9229
Scheduling of Cloud Computing Tasks via Intelligent Optimization Methods
Ammari, A. C., Labidi, W., Aldaoud, M., Mnif, F., Yuan, H., Zhou, M., & Sarrab, M. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-19-2397-5_21
Self-citationYang, L., Zhao, P. F., & Zhang, Y. (2023) · International Conference on Communications, Computing, Cybersecurity, and Informatics (CCCI) · doi:10.1109/ccci58712.2023.10290789
“Existing methods for reducing energy consumption from ITE equipment mainly revolve around resource allocation [3], virtual machine placement [4], workload allocation [5], and scheduling strategies [6].”
MethodSAT-GAV: A Electricity-Costs Aware Resources Placement Strategy for Data Centers
Feng, H., Xu, X., Chen, L., & Li, J. (2024) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa63168.2024.00195 · Cited by 1
“Parthiban et al. [19] introduced EAVMP-CSSA to lower consumption, while Zhou et al. [20] and Yuan et al. [7] used techniques like LEES and bi-objective differential evolution to minimize energy use.”
Distributed energy resource structures based on renewable resources for future data centers
Babanezhad, H., Moghadam, M. S., Çolak, İ., Brisbois, M., & Jambunathan, S. (2025) · Wind Engineering · doi:10.1177/0309524x251399067
“Using arti fi cial intelligence and identifying low-power servers and allocating tasks to them has resulted in optimal use of renewable energy by up to 20% (Yuan et al., 2021).”
Zhao, W., Xu, L., & Qi, Y. (2026) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2026.3670125
“Recent studies [24], [25], [26], [27] explored geographic load balancing, which involves shifting workloads among distributed data centers to exploit regional differences in renewable availability and electricity pricing.”
Oshima, H., Hashida, H., Kawamoto, Y., Kato, N., Sugyo, K., Hasegawa, Y., & Ariyoshi, M. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3672902
Power Grid Resilience Enhancement via Computing Task Migration of Data Centers
Hou, M., Zhang, X., & Hu, H. (2026) · IEEE PES International Meeting (PES IM) · doi:10.1109/pesim67009.2026.11438987
“Second, traditional methods rely on post-disaster passive adjustments incompatible with minute-level response needs of extreme events [9].”
Liu, Z., Sun, Y., Liu, C., Zhao, Z., & Cheng, L. (2026) · Journal of Cloud Computing Advances Systems and Applications · doi:10.1186/s13677-026-00894-6
“For instance, Yuan et al. [14] employ simulated annealing to address a bi-objective scheduling problem, simultaneously maximizing profit and minimizing the probability of task loss.”
AzuRe: Region- and Availability Zone-Aware Task Placement in Geo-Distributed Clouds
Wang, J., Shen, Q., Sun, Y.-E., & Huang, H. (2026) · IEEE Transactions on Networking · doi:10.1109/ton.2026.3691444
“…works like [13], [14], [15], [16], [17], [18], [19], and [20] try to optimize operational costs and improve resource utilization for service providers, while other works [19], [21], [22], [23], [24], [25], [26], [27] ensure QoS for tenants by minimizing transmission latency or improving throughput.”
Yuan, H., Bi, J., Zhou, M., & Buyya, R. (2026) · Internet of things · doi:10.1007/978-3-032-18400-9_1
Self-citationDu, Z., Hu, H., Hou, M., Ren, X., & Zhang, X. (2026) · IEEE/IAS Industrial and Commercial Power System Asia (I&CPS Asia) · doi:10.1109/icpsasia70813.2026.11692262
“It is imperative to tap into the load flexibility of intelligent computing centers and achieve computing power migration optimization, thereby transforming computing power loads into high-quality regulation resources that can support the secure and low-carbon operation of power systems [6-7].”
Metadata
- Authors
- Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C.
- Affiliations
- New Jersey Institute of Technology (US)
- Beijing University of Technology (CN)
- Sultan Qaboos University (OM)
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2021-04
- Volume
- 18
- Issue
- 2
- Pages
- 731-742
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W3000090293
- Cited by
- 138
- References
- 49
- Citations by year
- 2026: 10 · 2025: 16 · 2024: 17 · 2023: 23 · 2022: 21 · 2021: 25
- FWCI
- 22.34
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Automation Science and Engineering (publishedVersion)
- Funders
- National Natural Science Foundation of China (61802015, 61703011)
- Major Science and Technology Program for Water Pollution Control and Treatment of China (2018ZX07111005)
- National Defense Pre-Research Foundation of China (41401020401, 41401050102)
- Sultan Qaboos University through the Omantel Research Program (EG/SQU-OT/19/04)
- Topics
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
- Keywords
- task scheduling, bi-objective optimization, simulated annealing, differential evolution, Pareto front, quality of service, renewable energy, smart grid, internet service providers, task decomposition, multi-objective optimization
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
