Scheduling of conditional executed jobs on unrelated processors Original Research Article

In this paper we analyze a scheduling problem where each job j ϵ J is executed in dependence to a branching forest. We have a set of processor types P with a price c(p) for each processor of type p ϵ P. A job j processed on a processor of type pϵP has an execution time e(j,p) ϵ N. Given a deadline d ϵ N, we consider the problem to select a minimum cost set of processors (allowing an unlimited number of each type) for which there exists a schedule with makespan at most d. We propose an algorithm for the scheduling problem with approximation bound 0(log¦J¦).