{"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}
引用次数: 1
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.