This paper studies the performance of a group of heuristic methods developed to solve the Alternative Subgraphs Assembly Line Balancing Problem. This problem implies selecting an assembly subgraph for each subassembly that allows alternatives and assigning the tasks to the workstations, simultaneously. A computational experiment is carried out to analyse and compare the efficiency of the proposed procedures considering medium and large scale problems. Test results are reported.