Considerable research has been done in order to schedule tasks to a multiple processing systems. Some of the computation time of these tasks may, however, be imprecise due to the nature of the problem. In this paper, an imprecise task graph is used to model the problem where each node represents a task associated with its computation time. An algorithm, called rotation scheduling, is extended t...