Parallel computing application into the particle swarm optimization algorithm used to solve the Job-Shop scheduling problem
Jan Dismas Zelenka · 2011
Currently, on optimization processes requirements focusing on several parameters are emphasized. Algorithms allowing to find an optimal (near-optimal) solution, are in most cases moving in the large area of possible solutions. Their running requires strong computational support and hunger solution programs to run on multi-core workstation, clusters, grid and clouds. In this article serial and parallel computing of the Job-Shop scheduling problem by using MATLAB distributed computing server is compared.