An Exact Method for U-Shaped Assembly Line Balancing Problem

U-shaped assembly lines have been adopted in many manufacturing settings as part of just-in-time production principle. U-shaped line balancing problem (ULBP) is an extension of the traditional line balancing problem, in which tasks can be assigned from both sides of the precedence graph. In this paper, based on the integer programming formulation developed by Urban, the solving procedure for ULBP is constructed by the syntax of Lingo 9.0 extended version. An illustrative example is followed to describe the detailed solving procedure. The results of the computational study show that the procedure is effectively.