Scheduling Techniques for Periodic Jobs in a Heterogeneous Environment

This paper considers a scheduling problem for periodic jobs in a heterogeneous environment. There are m heterogeneous processors and n identical jobs. Jobs are released one at a time periodically. Each job is assigned to a processor for execution. Preemption is not allowed. The goal is to minimize the summation of completion time ofll the jobs.e borrow the idea from Dessouky et al. to propose an approximation algorithm for scheduling identical and periodic jobs to heterogeneous processors. We show that there is a competetive ratio related to the processing time of the fastest processor in this problem.