Carlier, J.; Pinson, E. - In: Management Science 35 (1989) 2, pp. 164-176
In this paper, we propose a branch and bound method for solving the job-shop problem. It is based on one-machine scheduling problems and is made more efficient by several propositions which limit the search tree by using immediate selections. It solved for the first time the famous 10 \times 10...