电子制造业MES技术分析与优化

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

摘要

针对传统MES作业调度算法运行时间长、复杂度大的不足,本文采用了一种基于规则的最优调度方法。它以相对剩余时间最长为条件进行优化操作。该调度规则保证了最长进程的优先调度,通过比较调度进程在部分调度集中的竞争进程集的相对剩余周期来求解各部分调度的最优解,达到整体最优的全局最优或近似最优。实验表明,改进后的算法在面对复杂调度时能够保证计算速度,并通过缩短整个工程工期来逼近约束条件下的最优解,在实际工作中具有较强的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信