Procedures for the Time and Space constrained Assembly Line Balancing Problem

Procedures for the Time and Space constrained Assembly Line Balancing Problem
Bautista, Joaquín; Pereira, Jordi
2011-08-01 00:00:00
The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngEuropean Journal of Operational ResearchElsevierhttp://www.deepdyve.com/lp/elsevier/procedures-for-the-time-and-space-constrained-assembly-line-balancing-92XBVuqi6G

Procedures for the Time and Space constrained Assembly Line Balancing Problem

Abstract

The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.