This research examines an assembly line balancing problem and compares the linear programing with a Greedy Randomized Adaptive Search Procedure (GRASP). The problem focuses on minimizing the absolute average deviation for the ergonomic risk between the set of workstations of the line, considering a fixed cycle time and an available space per station. However, the final objective is to obtain line configurations with the lowest possible ergonomic risk, and the lowest discrepancy for the risk level between all stations. Although GRASP does not win linear programing, in all cases, it shows competitive