Soroush, H.M. - In: European Journal of Industrial Engineering 6 (2012) 5, pp. 596-628
. The goal is to find the optimal sequences that minimise objective functions such as the makespan, total completion time …; however, the general problems are difficult to solve. We propose branch-and-bound (B%B) methods to derive the optimal … sequences for such problems. Computational results show that the proposed methods can solve relatively large problem instances …