A new formulation of the problem of three machines, where the executio
n times are defined by the intervals of possible values, is considered
. The problem is shown to be reducible to two ordinary problems of thr
ee machines. An algorithm for its solution is described.