Therefore, modified precedence constraints have to be observed. Comprehensive descriptions of all problem types outlined above can be found in the literature listed below. Solution procedures For solving these problems exact as well as heuristic procedures have been developed. It contains a clever branching strategy and various known and new lower bounding procedures. Several optional elements of tabu search are examined.
Computational experiments validate the effectiveness of our new approaches.
For solving the rather complex MSP we propose an effective tabu search procedure based on sequence patterns and a branch and bound procedure. Comprehensive descriptions of all procedures mentioned above can be found in the literature listed below. 2nd ed., Physica, Heidelberg, 1999. Maximizing the Production Rate in Simple Assembly Line Balancing -a Branch and Bound Procedure . Simple Assembly Line Balancing - Heuristic Approaches .