In a recent paper [1], a method for finding an optimal order of scheduling certain tasks was proposed. Each of the problems is characterized by a vector of features. The proposed method constructs a projection to the time axis which minimizes a certain error functional, using SVM like techniques as studied e.g. in [6], [7] and cited there papers. In the considered application, those vectors contained information about the dependence of the considered problem on the other tasks to be scheduled. Zero entries indicate independence, ones mean that the given task needs to wait until the other task is finished, [1]. In this paper, we study medium size examples and compare the performance of the proposed method to an alternative which uses a graph-theoretical approach.