TSALBP: Time and Space constrained Assembly Line Balancing Problems

  • An Ant Algorithm for Assembly Line Balancing Problems with Additional Space Constraints



Joaquín Bautista1 and Jordi Pereira1


1 UPC - Nissan Chair


The present paper focuses on the application of a procedure based on ant colonies to solve an assembly line balancing problem. After an introduction to assembly line problems, the problem under study is presented: the Time and Space constrained Assembly Line Balancing Problem (TSALBP). Subsequently, an ant algorithm is presented that incorporates some ideas that have offered good results with simple balancing problems. Finally, the validity of the proposed algorithms is tested by means of a computational experience with reference instances, and the conclusions of the study are presented.

Return to previous page