基于非合作博弈的云制造调度优化算法

Guanyu Zhu, Xia Shao
{"title":"基于非合作博弈的云制造调度优化算法","authors":"Guanyu Zhu, Xia Shao","doi":"10.1109/ICIM56520.2022.00035","DOIUrl":null,"url":null,"abstract":"Cloud manufacturing is a new manufacturing model based on the network and service-oriented intelligent. For the optimal allocation resources of the cloud manufacturing, many experts and scholars individually consider time, quality, or cost factors related to manufacturing products, but do not fully consider the multi-objective requirements of products, for example, the scheduling problem of simultaneously considering the deadline and cost of products in the cloud manufacturing. Aiming at the above problems, a cloud manufacturing scheduling optimization algorithm based on non-cooperative games is proposed. The algorithm uses non-cooperative game methods to deal with the scheduling question of the deadline and cost constraints of products. For the selection of network resources in the scheduling process, the Nash equilibrium strategy is adopted. Select the network manufacturing resources that can not only meet the deadline constraints but also reduce the product cost in the scheduling processing. The Experimental results show that the algorithm can effectively solve the scheduling problem with deadline and cost constraints in the cloud manufacturing.","PeriodicalId":391964,"journal":{"name":"2022 8th International Conference on Information Management (ICIM)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Scheduling Optimization Algorithm Based on Non-Cooperative Game in the Cloud Manufacturing\",\"authors\":\"Guanyu Zhu, Xia Shao\",\"doi\":\"10.1109/ICIM56520.2022.00035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud manufacturing is a new manufacturing model based on the network and service-oriented intelligent. For the optimal allocation resources of the cloud manufacturing, many experts and scholars individually consider time, quality, or cost factors related to manufacturing products, but do not fully consider the multi-objective requirements of products, for example, the scheduling problem of simultaneously considering the deadline and cost of products in the cloud manufacturing. Aiming at the above problems, a cloud manufacturing scheduling optimization algorithm based on non-cooperative games is proposed. The algorithm uses non-cooperative game methods to deal with the scheduling question of the deadline and cost constraints of products. For the selection of network resources in the scheduling process, the Nash equilibrium strategy is adopted. Select the network manufacturing resources that can not only meet the deadline constraints but also reduce the product cost in the scheduling processing. The Experimental results show that the algorithm can effectively solve the scheduling problem with deadline and cost constraints in the cloud manufacturing.\",\"PeriodicalId\":391964,\"journal\":{\"name\":\"2022 8th International Conference on Information Management (ICIM)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 8th International Conference on Information Management (ICIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIM56520.2022.00035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 8th International Conference on Information Management (ICIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIM56520.2022.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

云制造是一种基于网络化、服务化、智能化的新型制造模式。对于云制造的资源优化配置,许多专家学者单独考虑了与制造产品相关的时间、质量或成本等因素,而没有充分考虑产品的多目标需求,例如云制造中同时考虑产品的截止日期和成本的调度问题。针对上述问题,提出了一种基于非合作博弈的云制造调度优化算法。该算法采用非合作博弈方法处理产品的期限约束和成本约束的调度问题。对于调度过程中网络资源的选择,采用纳什均衡策略。在调度过程中,选择既能满足工期约束又能降低产品成本的网络制造资源。实验结果表明,该算法能有效地解决云制造中具有时间期限和成本约束的调度问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Scheduling Optimization Algorithm Based on Non-Cooperative Game in the Cloud Manufacturing
Cloud manufacturing is a new manufacturing model based on the network and service-oriented intelligent. For the optimal allocation resources of the cloud manufacturing, many experts and scholars individually consider time, quality, or cost factors related to manufacturing products, but do not fully consider the multi-objective requirements of products, for example, the scheduling problem of simultaneously considering the deadline and cost of products in the cloud manufacturing. Aiming at the above problems, a cloud manufacturing scheduling optimization algorithm based on non-cooperative games is proposed. The algorithm uses non-cooperative game methods to deal with the scheduling question of the deadline and cost constraints of products. For the selection of network resources in the scheduling process, the Nash equilibrium strategy is adopted. Select the network manufacturing resources that can not only meet the deadline constraints but also reduce the product cost in the scheduling processing. The Experimental results show that the algorithm can effectively solve the scheduling problem with deadline and cost constraints in the cloud manufacturing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信