Tardiness Bounds for Sporadic Gang Tasks Under Preemptive Global EDF Scheduling.
Zheng DongKecheng YangNathan FisherCong LiuPublished in: IEEE Trans. Parallel Distributed Syst. (2021)
Keyphrases
- scheduling algorithm
- scheduling problem
- single machine
- processing times
- computational grids
- minimize total
- response time
- parallel machines
- scheduling jobs
- lower bound
- flowshop
- sequence dependent setup times
- np hard
- setup times
- upper bound
- precedence constraints
- release dates
- round robin
- real time database systems
- job shop scheduling problem
- worst case
- tabu search
- identical machines
- identical parallel machines
- lower and upper bounds
- steady state
- batch processing
- genetic algorithm