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

J. Zelenka
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将并行计算应用于粒子群优化算法中,用于解决作业车间调度问题
目前,对优化过程的要求主要集中在几个参数上。允许找到最优(接近最优)解的算法,在大多数情况下都是在可能解的大范围内移动。它们的运行需要强大的计算支持和饥饿解决方案,以便在多核工作站、集群、网格和云上运行。本文比较了利用MATLAB分布式计算服务器对作业车间调度问题的串行和并行计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms for pitch distance determination Ontology-coupled active contours for dynamic video scene understanding Linear octapolar radiofrequency tool for liver ablation Integrated approach to course and engineering model for automation related topics 3DOF drawing robot using LEGO-NXT
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1