基于随机森林的柔性作业车间调度规则挖掘

Yizhong Wang
{"title":"基于随机森林的柔性作业车间调度规则挖掘","authors":"Yizhong Wang","doi":"10.1109/CDS52072.2021.00045","DOIUrl":null,"url":null,"abstract":"With the development of the global economy and customization, the manufacturing scheduling problem is increasingly complicated. Flexible job shops (FJSs) have to be more flexible and dynamic to handle these complex and various manufacturing environments. Aiming at the dynamic scheduling problem of FJS, a method of mining scheduling rules from scheduling related historical data with industrial big data characteristics is proposed. In the mining of scheduling rules, an improved random forest algorithm is proposed, which is suitable for mining scheduling rules from historical data related to large-scale, high-dimensional, and noisy scheduling. Experimental results show that the scheduling rules obtained by the mining method have good performance in terms of scheduling performance and computational efficiency.","PeriodicalId":380426,"journal":{"name":"2021 2nd International Conference on Computing and Data Science (CDS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Flexible Job Shop Scheduling Rules Mining Based on Random Forest\",\"authors\":\"Yizhong Wang\",\"doi\":\"10.1109/CDS52072.2021.00045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the development of the global economy and customization, the manufacturing scheduling problem is increasingly complicated. Flexible job shops (FJSs) have to be more flexible and dynamic to handle these complex and various manufacturing environments. Aiming at the dynamic scheduling problem of FJS, a method of mining scheduling rules from scheduling related historical data with industrial big data characteristics is proposed. In the mining of scheduling rules, an improved random forest algorithm is proposed, which is suitable for mining scheduling rules from historical data related to large-scale, high-dimensional, and noisy scheduling. Experimental results show that the scheduling rules obtained by the mining method have good performance in terms of scheduling performance and computational efficiency.\",\"PeriodicalId\":380426,\"journal\":{\"name\":\"2021 2nd International Conference on Computing and Data Science (CDS)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Computing and Data Science (CDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDS52072.2021.00045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computing and Data Science (CDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDS52072.2021.00045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着全球经济和定制化的发展,制造调度问题日益复杂化。灵活作业车间(fjs)必须更加灵活和动态,以处理这些复杂和各种制造环境。针对FJS的动态调度问题,提出了一种从具有工业大数据特征的调度相关历史数据中挖掘调度规则的方法。在调度规则挖掘中,提出了一种改进的随机森林算法,该算法适用于大规模、高维、有噪声调度的历史数据调度规则挖掘。实验结果表明,该挖掘方法获得的调度规则在调度性能和计算效率方面具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flexible Job Shop Scheduling Rules Mining Based on Random Forest
With the development of the global economy and customization, the manufacturing scheduling problem is increasingly complicated. Flexible job shops (FJSs) have to be more flexible and dynamic to handle these complex and various manufacturing environments. Aiming at the dynamic scheduling problem of FJS, a method of mining scheduling rules from scheduling related historical data with industrial big data characteristics is proposed. In the mining of scheduling rules, an improved random forest algorithm is proposed, which is suitable for mining scheduling rules from historical data related to large-scale, high-dimensional, and noisy scheduling. Experimental results show that the scheduling rules obtained by the mining method have good performance in terms of scheduling performance and computational efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信