Multi-Tree Genetic Programming with Rule Reconstruction for Dynamic Task Scheduling in Integrated Cloud-Edge Satellite-Terrestrial Networks
Created by W.Langdon from
gp-bibliography.bib Revision:1.8344
- @Article{Zhang:ieeeIOT,
-
author = "Changzhen Zhang and Jun Yang and Ning Wang",
-
title = "Multi-Tree Genetic Programming with Rule
Reconstruction for Dynamic Task Scheduling in
Integrated Cloud-Edge Satellite-Terrestrial Networks",
-
journal = "IEEE Internet of Things Journal",
-
keywords = "genetic algorithms, genetic programming, Dynamic
scheduling, Processor scheduling, Scheduling, Cloud
computing, Heuristic algorithms, Servers, Job shop
scheduling, Real-time systems, Satellites, Routing,
Satellite-terrestrial networks, dynamic task
scheduling, rule reconstruction, scheduling heuristic",
-
ISSN = "2327-4662",
-
DOI = "
doi:10.1109/JIOT.2025.3546867",
-
abstract = "Satellite-Terrestrial Networks (STNs) are a promising
paradigm for providing internet services for users
globally. Since the dynamics of service resources and
the uncertainty of computational requests, how the
service resources in STNs can be efficiently exploited
to execute differentiated computational tasks is an
essential challenge. In this work, we investigate the
dynamic task scheduling in the integrated cloud-edge
STNs. Firstly, we propose a cloud-edge collaborative
computing framework in STNs, where the computational
tasks of users can be processed collaboratively by
satellite edge servers, terrestrial edge servers, and
cloud servers. Based on this framework, a dynamic task
scheduling problem is formulated with the objective of
maximizing the task success rate. Secondly, to make
effective real-time decisions at decision points in the
dynamic scheduling process, we develop a scheduling
heuristic with the routing rule and queuing rule, which
incorporates dynamic features related to servers,
computational tasks, and network environments. Thirdly,
to automatically learn the scheduling heuristic, we
propose a Multi-Tree Genetic Programming with Rule
Reconstruction (MTGPRR), which introduces a selective
reconstruction operator. This operator increases the
chance of matching good rules with other rules by
recombining common individuals and elites. Experimental
results demonstrate that the proposed MTGPRR performs
significantly better than the state-of-the-art methods
in improving the task success rate. Moreover, the
evolved scheduling heuristic has good interpretability,
which is important for practical applications.",
-
notes = "Also known as \cite{10907950}
School of Reliability and Systems Engineering, Beihang
University, Beijing, China",
- }
Genetic Programming entries for
Changzhen Zhang
Jun Yang
Ning Wang
Citations