go-v.orgdoi

Task Scheduling Optimization in Cloud-Edge Collaborative Architecture via a Multi-Strategy Artificial Lemming Algorithm

Yue Zhang, Jianfeng Wang · Mathematics · 2026

  • DOI 10.3390/math14101659
  • Publisher Multidisciplinary Digital Publishing Institute
  • Type article
  • Issued 2026

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Mathematics · Multidisciplinary Digital Publishing Institute · article · 2026

Abstract

In the cloud computing environment, various heterogeneous architectures have emerged, and the cloud-edge collaborative task scheduling architecture has come into being under this background. However, the complexity of cloud-edge heterogeneous architecture significantly restricts the improvement of scheduling performance. Therefore, researchers propose solving this problem by leveraging intelligent optimization algorithms. The Artificial Lemming Algorithm has received extensive attention due to its strong robustness.

However, when dealing with the problem of cloud-edge collaborative task scheduling, there are still some drawbacks, such as long system response time and unstable scheduling performance. In response to the above problems, this paper proposes a multi-strategy artificial lemming algorithm. Specifically, by coordinating high-order Chebyshev polynomials with chaotic mapping to enhance the richness of the initial population, the scheduling response time is indirectly shortened.

Secondly, the Adaptive Spatial Search Mechanism is introduced to make up for the deficiencies in the exploration stage, enhance the algorithm’s exploration ability, and thereby improve the optimization effect of scheduling satisfaction. Furthermore, the Bernstein-Guided Correction Strategy is introduced to enhance the exploitation capability of the algorithm to improve the stability of cloud-edge scheduling. The experimental results demonstrate that compared with the baseline algorithms, the proposed MALA reduces the total scheduling cost by at least 3% across cloud-edge collaborative resource scheduling problems of different scales.

Open the resolved locator · 10.3390/math14101659

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 03:36 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.3390/math14101659
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.