The well-known m-machine problem in which job times are defined by intervals of possible values is formulated in new terms. This problem is reduced to two usual m-machine problems and a solution algorithm is designed. Part I is devoted to the formulation of the problem and ideas underlying its solution and the necessary mathematical apparatus, whereas Part II is concerned with the solution.
