{"title":"Parallel computing application into the particle swarm optimization algorithm used to solve the Job-Shop scheduling problem","authors":"J. Zelenka","doi":"10.1109/INES.2011.5954742","DOIUrl":null,"url":null,"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.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 15th IEEE International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.2011.5954742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
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.