An Algorithm for Solving the Job-Shop Problem
- 1 February 1989
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 35 (2) , 164-176
- https://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 \times 10 job-shop problem proposed by Muth and Thompson in 1963.job shop scheduling, branch-and-bound, computational experimentsKeywords
This publication has 0 references indexed in Scilit: