The scheduling a three-machine job shop problem

As an extension of [1] a schedule is developed for 3-machine job shop problem for which the difference between total elapsed time and minimal time does not exceed $3(3\sqrt{2}+5)\max t_{ij}$. A scheduling algorithm is given.