The job-shop problem and immediate selection
For solving job-shop problems using a branch-and-bound method it is important to introduce order relations before the branching starts in order to reduce the computational effort. This may be done by using immediate selection methods to fix as many order relations as possible. In this article, some new methods for an immediate selection are provided. The methods are tested numerically and the computational results illustrate the effectiveness of the approach.
scientific article; zbMATH DE number 698905