Los puntos clave no están disponibles para este artículo en este momento.
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 × 10 job-shop problem proposed by Muth and Thompson in 1963.
Carlier et al. (Wed,) studied this question.