Scheduling of Conditional Executed Jobs on Unrelated Processors

  • Klaus Jansen
  • Published 1993 in
    Universität Trier, Mathematik/Informatik…


In this paper we analyze a scheduling problem where each job j E 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 E P. A job j processed on a processor of type p E P has an execution time e(j,p) E N. Given a deadline d E N, we consider the problem to select a minimum cost… (More)
DOI: 10.1016/0166-218X(94)00013-4


  • Presentations referencing similar topics