Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing.
Chi ZhangHaisheng TanHaoqiang HuangZhenhua HanShaofeng H.-C. JiangGuopeng LiXiangyang LiPublished in: IEEE/ACM Trans. Netw. (2023)
Keyphrases
- polynomial time approximation
- identical machines
- job scheduling
- approximation algorithms
- minimize total
- scheduling strategy
- scheduling problem
- parallel machines
- error bounds
- precedence constraints
- online learning
- processing times
- identical parallel machines
- weighted tardiness
- unrelated parallel machines
- approximation schemes
- scheduling policies
- release dates
- scheduling algorithm
- single machine
- efficient computation
- deteriorating jobs
- setup times
- utility function
- maximum lateness
- real time
- special case
- batch processing machines
- randomized approximation
- np hard
- single machine scheduling problem
- grid environment
- queueing networks
- precedence relations
- wafer fabrication
- edge detection
- optimal scheduling
- weighted graph
- release times
- scheduling jobs
- computational grids
- edge information
- fixed number
- polynomial approximation
- error tolerance
- single server
- response time
- wireless sensor networks
- completion times