By Topic

Parallel computing application into the particle swarm optimization algorithm used to solve the Job-Shop scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zelenka, J. ; Inst. of Inf., Slovak Acad. of Sci., Bratislava, Slovakia

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.

Published in:

Intelligent Engineering Systems (INES), 2011 15th IEEE International Conference on

Date of Conference:

23-25 June 2011