TSALBP: Time and Space constrained Assembly Line Balancing Problems
Ant algorithms for a time and space constrained assembly line balancing problem
Authors
Joaquín Bautista1 and Jordi Pereira1
Abstract
The present article 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); and a basic model of one of its variants is put forward for study. 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.
A simplified instance from NISSAN Pathfinder Engine Assembly Line Balancing: NISSAN-01
Number (j), internal identifier (Id.), operation time (t), required area (a) and set of immediately predecessor tasks (P), are given for each task. Best found solution for SALBP-1 and TSALBP-1 are also reported, giving the station assignment of each task under the column SALBP-1 and TSALBP-1 respectively (c = 180 sec, A = 4 m).
You can see the graph for NISSAN-01 here
