In this work, we deal with the Discrete Parallel Machine Makespan Scheduling and Location Problem (DPMMSLP), also known as ScheLoc problem. This problem integrates two well studied combinatorial optimization problems: (i) the parallel machines scheduling problem with the objective of minimizing the makespan; and the (ii) facility location problem. In the DPMMSLP, the objective is to define where locate the available machines and define the job sequencing on these machines in order to minimize the total time for processing all jobs, i.e., the makespan. To solve this problem, we present and integrate exact and heuristic methods into a framework. The framework was evaluated in benchmark instances from the literature and the obtained results show the good performance of the method.