The paper presents a heuristic algorithm to schedule real time
indivisible loads represented as directed sequential task graph
on a cluster computing. One of the cluster nodes has some
special resources (denoted by special node) that may be needed
by one of the indivisible loads