Resource allocation in cloud manufacturing using bat algorithm

N. Brintha, S. Benedict, J. Jappes
{"title":"Resource allocation in cloud manufacturing using bat algorithm","authors":"N. Brintha, S. Benedict, J. Jappes","doi":"10.1504/ijmtm.2020.10028440","DOIUrl":null,"url":null,"abstract":"Due to the advancements in information and communication technologies, growing volatility and business competitiveness, manufacturing industries have started to change their strategies of pursuing business. As a consequence of this change, cloud based manufacturing systems have emerged and one of the major challenges in such systems is optimal resource allocation to tasks in production line. However, utilising manufacturing cloud resources for satisfying job requirements needs much more effort. In our work, we present a better assignment of resource to tasks by having a qualitative analysis of match between task and the resources through the use of adaptive search mechanism. We propose a bat-based heuristic approach, to work on improving computation time, makespan and balance in workload. Progressive experimentation was made in casting of engine block and the results show that, usage of bat algorithm supports rapid convergence. Also, bat algorithm is used to provide optimal resource allocation among tasks. This algorithm improves workflow performance by minimising makespan. The proposed workflow approach satisfies large scale production requirements in manufacturing environment and can achieve optimal solution by minimising delays.","PeriodicalId":198641,"journal":{"name":"Int. J. Manuf. Technol. Manag.","volume":"241 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Manuf. Technol. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijmtm.2020.10028440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Due to the advancements in information and communication technologies, growing volatility and business competitiveness, manufacturing industries have started to change their strategies of pursuing business. As a consequence of this change, cloud based manufacturing systems have emerged and one of the major challenges in such systems is optimal resource allocation to tasks in production line. However, utilising manufacturing cloud resources for satisfying job requirements needs much more effort. In our work, we present a better assignment of resource to tasks by having a qualitative analysis of match between task and the resources through the use of adaptive search mechanism. We propose a bat-based heuristic approach, to work on improving computation time, makespan and balance in workload. Progressive experimentation was made in casting of engine block and the results show that, usage of bat algorithm supports rapid convergence. Also, bat algorithm is used to provide optimal resource allocation among tasks. This algorithm improves workflow performance by minimising makespan. The proposed workflow approach satisfies large scale production requirements in manufacturing environment and can achieve optimal solution by minimising delays.
基于bat算法的云制造资源分配
随着信息通信技术(ict)的进步、波动性和企业竞争力的增加,制造业开始改变经营战略。由于这种变化,基于云的制造系统已经出现,这种系统的主要挑战之一是生产线任务的最佳资源分配。然而,利用制造云资源来满足工作需求需要付出更多的努力。在我们的工作中,我们通过使用自适应搜索机制对任务和资源之间的匹配进行定性分析,从而更好地为任务分配资源。我们提出了一种基于蝙蝠的启发式方法来改进计算时间、完工时间和工作负载的平衡。在发动机缸体的铸造过程中进行了渐进式实验,结果表明,采用蝙蝠算法可以实现快速收敛。同时,采用bat算法实现任务间资源的最优分配。该算法通过最小化完工时间来提高工作流性能。所提出的工作流方法满足制造环境中大规模生产的需求,并能通过最小化延迟来获得最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信