{"title":"电子制造业MES技术分析与优化","authors":"Yan-Bo Yang","doi":"10.1109/ICRIS.2017.57","DOIUrl":null,"url":null,"abstract":"For the deficiency of long running time and large complexity of traditional MES job scheduling algorithm, this paper adopts a optimal scheduling approach based on rules. It performs optimized operations with the conditions of the longest relative surplus. The scheduling rule ensures the priority scheduling of the longest process, which can solve the optimal solution of each partial scheduling by comparing relative remaining period of the competitive process set of the scheduling process in partially scheduled set, to achieve global optimum or approximate optimum of the overall optimum. The tests demonstrate that the improved algorithm can ensure the computing speed when confronting complex scheduling and approach the optimum solution under constrict conditions by shorten the entire duration of project, which shows strong practical value in actual work.","PeriodicalId":443064,"journal":{"name":"2017 International Conference on Robots & Intelligent System (ICRIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"MES Technology Analysis and Optimization for Electronic Manufacturing Industry\",\"authors\":\"Yan-Bo Yang\",\"doi\":\"10.1109/ICRIS.2017.57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the deficiency of long running time and large complexity of traditional MES job scheduling algorithm, this paper adopts a optimal scheduling approach based on rules. It performs optimized operations with the conditions of the longest relative surplus. The scheduling rule ensures the priority scheduling of the longest process, which can solve the optimal solution of each partial scheduling by comparing relative remaining period of the competitive process set of the scheduling process in partially scheduled set, to achieve global optimum or approximate optimum of the overall optimum. The tests demonstrate that the improved algorithm can ensure the computing speed when confronting complex scheduling and approach the optimum solution under constrict conditions by shorten the entire duration of project, which shows strong practical value in actual work.\",\"PeriodicalId\":443064,\"journal\":{\"name\":\"2017 International Conference on Robots & Intelligent System (ICRIS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Robots & Intelligent System (ICRIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRIS.2017.57\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Robots & Intelligent System (ICRIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRIS.2017.57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MES Technology Analysis and Optimization for Electronic Manufacturing Industry
For the deficiency of long running time and large complexity of traditional MES job scheduling algorithm, this paper adopts a optimal scheduling approach based on rules. It performs optimized operations with the conditions of the longest relative surplus. The scheduling rule ensures the priority scheduling of the longest process, which can solve the optimal solution of each partial scheduling by comparing relative remaining period of the competitive process set of the scheduling process in partially scheduled set, to achieve global optimum or approximate optimum of the overall optimum. The tests demonstrate that the improved algorithm can ensure the computing speed when confronting complex scheduling and approach the optimum solution under constrict conditions by shorten the entire duration of project, which shows strong practical value in actual work.