Description:Parallel Simulated Annealing algoritm for the weighted Unrelated Parallel Machines Problem
Abstract:The problem of a sequence of ’n’ jobs on ’m’ unrelated parallel machines without interruptions is classified as an NP-complete problem. Researchers have focused on this type of problem because of the hardness it presents when searching for an optimum solution. It is also of interest due to its wide application in the manufacturing industry. Many investigations have been carried out in order to find algorithms that solve this problem. In order to solve the problem, a parallel algorithm is developed using c/c++, MonteCarlo and MPI libraries. This application runs on a HPC cluster with Scientific Linux 4.7, NFS, GCC and MPI. Our interest is to provide a front-end using the EELA-2 infrastructure.