An approximate algorithm for the three-machine problem

$NP$-completeness in the strong sense for one of the numerous subproblems of three machine tools leads to an approximate solution method with polynomial operating time lor a general case of the Bellman–Johnson $3\times n$ problem.