In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time (∑kC_i). Simulated annealing is applied to the problem, which is modeled as a Weighted Bipartite Matching Problem. Experimental results with benchmarks are presented, evaluating the efficiency and efficacy of the algorithm. It is then compared with an exact algorithm that solves the pondered model of Integer Linear Programming. The results demonstrate that Simulated Annealing Algorithm has high performance because for all the evaluated instances, it finds the optimum global solution.
展开▼
