| Article ID: | iaor19881006 |
| Country: | United States |
| Volume: | 35 |
| Issue: | 2 |
| Start Page Number: | 164 |
| End Page Number: | 176 |
| Publication Date: | Feb 1989 |
| Journal: | Management Science |
| Authors: | Pinson E., Carlier J. |
| Keywords: | production, computational analysis, programming: integer |
In this paper, the authors 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.