DocumentCode
2308337
Title
Parallel computing application into the particle swarm optimization algorithm used to solve the Job-Shop scheduling problem
Author
Zelenka, J.
Author_Institution
Inst. of Inf., Slovak Acad. of Sci., Bratislava, Slovakia
fYear
2011
fDate
23-25 June 2011
Firstpage
183
Lastpage
189
Abstract
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.
Keywords
job shop scheduling; parallel processing; particle swarm optimisation; workstations; MATLAB distributed computing server; hunger solution program; job shop scheduling problem; multicore workstation; parallel computing application; particle swarm optimization algorithm; serial computing; Computational modeling; Films; MATLAB; Mathematical model; Parallel processing; Schedules; Servers;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Engineering Systems (INES), 2011 15th IEEE International Conference on
Conference_Location
Poprad
Print_ISBN
978-1-4244-8954-1
Type
conf
DOI
10.1109/INES.2011.5954742
Filename
5954742
Link To Document