An Algorithm for Solving the Job-Shop Problem
Published Online:1 Feb 1989https://doi.org/10.1287/mnsc.35.2.164
Abstract
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.
