The triangle scheduling problem

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the . It is shown that the Greedy algorithm solves the problem to optimality when the binary tree ratio of the input instan...更多