We study a resource constrained assembly line balancing problem (RCALBP) presented by Ağpak and Gökçen, who developed a 0-1 integer programming model to find the optimal solution. However, this model is inefficient in solving large-scale problems. In this paper, we propose a simple efficient heuristic that is based on the widely-used ranked positional weight (RPW) rule. The example given by Ağpak and Gökçen is used for illustration, and numerical results of sample problems selected from the literature are given to show the effectiveness of the proposed heuristic.
