Binary integer formulation for mixed-model assembly line balancing problem
Computers and Industrial Engineering
Ant algorithms for discrete optimization
Artificial Life
Two-sided assembly line balancing to maximize work relatedness and slackness
Computers and Industrial Engineering
Ant Algorithms for Assembly Line Balancing
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II
Computers and Industrial Engineering
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Computers and Operations Research
Balancing fuzzy multi-objective two-sided assembly lines via Bees Algorithm
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - FUZZYSS’2009
Multiple-colony ant algorithm for parallel assembly line balancing problem
Applied Soft Computing
Engineering Applications of Artificial Intelligence
Bee colony intelligence in zone constrained two-sided assembly line balancing problem
Expert Systems with Applications: An International Journal
A solution procedure for type E simple assembly line balancing problem
Computers and Industrial Engineering
Computers and Industrial Engineering
Enhanced mixed integer programming model for a transfer line design problem
Computers and Industrial Engineering
Computers and Industrial Engineering
Two-sided assembly line balancing considering the relationships between tasks
Computers and Industrial Engineering
Computers and Industrial Engineering
| Hi-index | 0.01 |
Two-sided assembly lines are a special type of assembly lines in which workers perform assembly tasks in both sides of the line. This type of lines is of crucial importance, especially in the assembly of large-sized products, like automobiles, buses or trucks, in which some tasks must be performed at a specific side of the product. This paper presents an approach to address the two-sided mixed-model assembly line balancing problem. First, a mathematical programming model is presented to formally describe the problem. Then, an ant colony optimisation algorithm is proposed to solve the problem. In the proposed procedure two ants 'work' simultaneously, one at each side of the line, to build a balancing solution which verifies the precedence, zoning, capacity, side and synchronism constraints of the assembly process. The main goal is to minimise the number of workstations of the line, but additional goals are also envisaged. The proposed procedure is illustrated with a numerical example and results of a computational experience that exhibit its superior performance are presented.