首页 | 本学科首页   官方微博 | 高级检索  
     

工期约束下加工型产品准确率串归约算法研究
引用本文:罗智勇,汪鹏,尤波,苏洁.工期约束下加工型产品准确率串归约算法研究[J].电子科技大学学报(自然科学版),2017,46(6):920-925.
作者姓名:罗智勇  汪鹏  尤波  苏洁
作者单位:1.哈尔滨理工大学计算机科学与技术学院 哈尔滨 150080
基金项目:国家自然科学基金青年项目61403109
摘    要:完工时间和准确率是生产调度的两个重要属性,然而单属性优化算法只能完成单个属性的优化,无法动态平衡这些属性。针对此问题,提出了基于有向无环图的串归约优化算法。算法通过约束每个任务的活动区间并采用逆向迭代进行归约,达到每层选择最优服务的目的,从而实现了这两个属性的优化。实验表明,该算法可准确地得到一条完工时间和准确率相互平衡的优化路径,但其优化效率受限于完工截止期和任务数。最后,研究结论对生产调度多属性的优化提供了一定的参考。

关 键 词:准确率优化    截止期    时间一致性    工作流调度
收稿时间:2016-06-20

Research on Serial Reduction Algorithm for Accuracy of Processing Products under Time Constraints
Affiliation:1.School of Computer Science and Technology, Harbin University of Science and Technology Harbin 1500802.School of Mechanical Engineering, Harbin University of Science and Technology Harbin 150080
Abstract:Completion time and accuracy are the most important attributes of processing products' business, however, single attribute optimization algorithm only can optimize one attribute, let alone balancing these two attributes dynamically. In order to fix this problem, a serial reduction algorithm based on directed acyclic graph is proposed. The algorithm constraints each tasks' activity section by using backwards iterative eduction to choose appropriate service for achieving the optimization of these two attributes. Statistical data shows that serial reduction algorithm does get an optimized path with time and accuracy balance, but its optimization efficiency is limited by the completion deadline and the number of tasks. The research conclusion provides a certain theoretical reference for the optimization of production scheduling.
Keywords:
点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号