An Exact Solution Approach to the Type-II Transfer Line Balancing Problem

Abstract

In this study, we consider Type II Transfer Line Balancing problem that assigns the operations to the blocks and blocks to the workstations to minimize the cycle time. A mixed integer programming model is developed, and a branch and bound algorithm is proposed for the exact solutions. The efficiency of the branch and bound algorithm is enhanced by lower and upper bounding procedures. The computational results have revealed the satisfactory behavior of the model and branch and bound algorithm on moderate size problem instances.