.png){kind=icon}
.png){kind=icon}
Return
Machine scheduling with restricted rejection: An Application to task offloading in cloud-edge collaborative computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2023.11.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the burgeoning of the Internet of everything, the amount of data generated by edge devices increases dramatically. In order to relieve the huge pressure of the could computing center, a popular computing scheme, called edge computing, is to select and process part of the computation tasks on edge servers of the network. In this paper we model the task offloading problem motivated by the popular Cloud-Edge Collaborative Computing Frame as a parallel -machine scheduling problem with restricted job rejection. We present an easy -to -implement heuristic with worst -case bound analysis and polynomial time approximation schemes for the general problem and some of the important special cases.
Keywords:
Scheduling
Cloud-edge computing
Heuristic
Approximation scheme
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W