In this article, three variants of allocation workload balance models are studied. This paper aims to analyse which of the three models developed has a better performance in terms of workload balancing and workload minimization in both identical parallel machines and unrelated parallel machines problems. The importance of workload balance scheduling problems lies in their potential to improve efficiency, resource utilization, and system performance while ensuring fairness and avoiding bottlenecks or overloads in various operational scenarios. A thorough computational study was conducted, using instances that follow a normal distribution to draw some conclusions. The tests were performed with different dimensions and considering resources with equal and different capacities. Finally, a statistical analysis was carried out, where it was possible to conclude that variant 1 has a better performance balancing the workload but variant 3 has a better performance minimizing the total workload.