Welcome to the InfoSci Platform
A Constrained Static Scheduling Strategy in Edge Computing for Industrial Cloud Systems

A Constrained Static Scheduling Strategy in Edge Computing for Industrial Cloud Systems

Yuliang Ma, Yinghua Han, Jinkuan Wang, Qiang Zhao
Copyright: © 2022 |Pages: 34
ISBN13: 9781668457009|ISBN10: 1668457008|EISBN13: 9781668457016
DOI: 10.4018/978-1-6684-5700-9.ch034
Cite Chapter Cite Chapter

MLA

Ma, Yuliang, et al. "A Constrained Static Scheduling Strategy in Edge Computing for Industrial Cloud Systems." Research Anthology on Edge Computing Protocols, Applications, and Integration, edited by Information Resources Management Association, IGI Global, 2022, pp. 681-714. https://doi.org/10.4018/978-1-6684-5700-9.ch034

APA

Ma, Y., Han, Y., Wang, J., & Zhao, Q. (2022). A Constrained Static Scheduling Strategy in Edge Computing for Industrial Cloud Systems. In I. Management Association (Ed.), Research Anthology on Edge Computing Protocols, Applications, and Integration (pp. 681-714). IGI Global. https://doi.org/10.4018/978-1-6684-5700-9.ch034

Chicago

Ma, Yuliang, et al. "A Constrained Static Scheduling Strategy in Edge Computing for Industrial Cloud Systems." In Research Anthology on Edge Computing Protocols, Applications, and Integration, edited by Information Resources Management Association, 681-714. Hershey, PA: IGI Global, 2022. https://doi.org/10.4018/978-1-6684-5700-9.ch034

Export Reference

Mendeley
Favorite

Abstract

With the development of industrial internet, attention has been paid for edge computing due to the low latency. However, some problems remain about the task scheduling and resource management. In this paper, an edge computing supported industrial cloud system is investigated. According to the system, a constrained static scheduling strategy is proposed to over the deficiency of dynamic scheduling. The strategy is divided into the following steps. Firstly, the queue theory is introduced to calculate the expectations of task completion time. Thereupon, the task scheduling and resource management problems are formulated and turned into an integer non-linear programming (INLP) problem. Then, tasks that can be scheduled statically are selected based on the expectation of task completion and constrains of various aspects of task. Finally, a multi-elites-based co-evolutionary genetic algorithm (MEB-CGA) is proposed to solve the INLP problem. Simulation result shows that the MEB-CGA significantly outperforms the scheduling quality of greedy algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.