An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem

Authors:
Liliana Capacho;Rafael Pastor;Alexander Dolgui;Olga Guschinskaya
Affiliations:
University of Los Andes, I.O. Department, EISULA and CESIMO, Mérida, Venezuela and Instituto de Organización y Control de Sistemas Industriales, ETS de Ingeniería Industrial de Barc ...;Instituto de Organización y Control de Sistemas Industriales, ETS de Ingeniería Industrial de Barcelona, Universitat Politècnica de Catalunya, Barcelona, Spain 08028;Division for Industrial Engineering and Computer Sciences, Ecole des Mines, St Etienne, France;Division for Industrial Engineering and Computer Sciences, Ecole des Mines, St Etienne, France
Venue:
Journal of Heuristics
Year:
2009

Citing 6
Cited 2

A comparative evaluation of heuristic line balancing techniques

Management Science
A survey of exact algorithms for the simple assembly line balancing problem

Management Science
Fast, effective algorithms for simple assembly line balancing problems

Operations Research
Applying the COMSOAL computer heuristic to the constrained resource allocation problem

Computers and Industrial Engineering
A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time

Computers and Industrial Engineering
The ASALB problem with processing alternatives involving different tasks: definition, formalization and resolution

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Rule-based modeling and constraint programming based solution of the assembly line balancing problem

Expert Systems with Applications: An International Journal
A decision support system for design of mass production machining lines composed of stations with rotary or mobile table

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper evaluates a set of constructive heuristic methods developed to solve the novel Alternative Subgraphs Assembly Line Balancing Problem (ASALBP), which considers variants for different parts of a production or manufacturing process. Each variant is represented by a precedence subgraph that defines the tasks to be performed and their processing times. The proposed methods use priority rules and random choice to select the assembly subgraphs and to assign the tasks to the stations in order to minimize the number of required workstations. The methods are evaluated by a computational experiment based on medium- and large-scale benchmark problems.