Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search

Published Online:https://doi.org/10.1287/opre.23.1.166

This paper presents a zero-one integer-programming formulation of the assembly line balancing (ALB) problem. Results indicate that this formulation requires as few as 50 to 60 percent of the number of variables required by other zero-one formulations of the ALB problem now in existence. Once formulated, problems are solved by examining a sequence of 0-1 programming problems for feasible solutions. Full advantage is taken of the structure of the 0-1 programs in determining feasibility. Computational results demonstrate the efficacy of the approach.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.