Job-shop scheduling problem and its solution method

The paper discusses a variation of the job-shop scheduling problem, its formal definition and solution methods. The variation takes into account the schedule of service points and their location. The authors propose an algorithm for solving the problem. The solution is reduced to multiple assignment problem solving using the branch-and-bound method. To determine the optimality criterion, the authors use both lower- and upper-bound estimates.