The Akers problem for variable operation processing times

The well-known “ob-shop” problem in the wider formulation (many machines of the same sort and many workers per one operation) is discussed in the paper. The graphic approach to the problem with two jobs and variable processing times of operations is proposed. It is shown that the more general problem can be formulated as creating a trajectory, consisting of the minimum number of one-unit-of-time segments.