The U-line Line Balancing Problem

TLDR

Line balancing traditionally groups tasks into sequential stations, but recent U‑line layouts permit forward, backward, or simultaneous grouping, increasing the problem’s complexity. This study introduces and models the U‑line line‑balancing problem and develops solution procedures, adapting existing techniques from traditional line balancing. The authors formulate the U‑line LB problem and adapt conventional line‑balancing algorithms to accommodate bidirectional and simultaneous task grouping. Computational experiments on benchmark problems show that the adapted methods are effective and produce feasible solutions.

Abstract

The traditional line balancing (LB) problem considers a production line in which stations are arranged consecutively in a line. A balance is determined by grouping tasks into stations while moving forward (or backward) through a precedence network. Recently many production lines are being arranged in a “U-line,” as a consequence of the use of just-in-time production principles in many factories. In this paper the U-line LB problem is introduced and modelled, and solution procedures are developed. It more complex than the traditional LB problem because tasks can be grouped by moving forward, backward, or simultaneously in both directions, through the precedence network. We also show how solution techniques developed for the traditional LB problem can be adapted for use with the new problem. Some computational results for well-known problems from the literature are given.