An Algorithm for Solving the Job-Shop Problem
提出一种基于单机调度问题的分支定界方法，通过立即选择限制搜索树，首次解决了Muth和Thompson于1963年提出的著名10×10作业车间问题。
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.