多变量系统生产计划调度中差分度量算法的评估

D. Gruzenkin, A. Kuznetsov, I. Seleznev
{"title":"多变量系统生产计划调度中差分度量算法的评估","authors":"D. Gruzenkin, A. Kuznetsov, I. Seleznev","doi":"10.17212/1814-1196-2020-4-65-80","DOIUrl":null,"url":null,"abstract":"In the process of designing a production plan, one of the important steps is scheduling the execution of technological operations. The schedule can be created either manually or by using software. If the schedule is compiled by software, then several schedule generation algorithms are used to eliminate possible errors. A set of such algorithms is called a \"batch\". It is advisable that only different algorithms should be included in the batch. This is necessary to eliminate errors of the same type. Therefore, the search for clones of algorithms in the batch is an urgent production task. To solve it a diversity metric of algorithms was developed in the course of this work. Such a metric numerically (as a percentage) determines how much the algorithms differ. This metric is based on the properties of the algorithm execution. Algorithm traces are constructed in the N-dimensional space using the obtained points. The coordinates of the trace points are the values with which the algorithm works at each step of its execution or each of the control points of the algorithm execution. An experiment was performed to confirm the correctness of this metric. Within this experiment, the trace properties of three sorting algorithms were calculated. Based on the properties obtained, indicators were determined for comparing algorithms in the metric space. The experiment confirmed the effectiveness of using the diversity metric to find clones in the algorithms batch. The scope of this metric is not limited to clone searches. It can be used as an independent indicator of software quality.","PeriodicalId":214095,"journal":{"name":"Science Bulletin of the Novosibirsk State Technical University","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An assessment of the algorithm difference measure in a multivariate system for production plans scheduling\",\"authors\":\"D. Gruzenkin, A. Kuznetsov, I. Seleznev\",\"doi\":\"10.17212/1814-1196-2020-4-65-80\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the process of designing a production plan, one of the important steps is scheduling the execution of technological operations. The schedule can be created either manually or by using software. If the schedule is compiled by software, then several schedule generation algorithms are used to eliminate possible errors. A set of such algorithms is called a \\\"batch\\\". It is advisable that only different algorithms should be included in the batch. This is necessary to eliminate errors of the same type. Therefore, the search for clones of algorithms in the batch is an urgent production task. To solve it a diversity metric of algorithms was developed in the course of this work. Such a metric numerically (as a percentage) determines how much the algorithms differ. This metric is based on the properties of the algorithm execution. Algorithm traces are constructed in the N-dimensional space using the obtained points. The coordinates of the trace points are the values with which the algorithm works at each step of its execution or each of the control points of the algorithm execution. An experiment was performed to confirm the correctness of this metric. Within this experiment, the trace properties of three sorting algorithms were calculated. Based on the properties obtained, indicators were determined for comparing algorithms in the metric space. The experiment confirmed the effectiveness of using the diversity metric to find clones in the algorithms batch. The scope of this metric is not limited to clone searches. It can be used as an independent indicator of software quality.\",\"PeriodicalId\":214095,\"journal\":{\"name\":\"Science Bulletin of the Novosibirsk State Technical University\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Science Bulletin of the Novosibirsk State Technical University\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17212/1814-1196-2020-4-65-80\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science Bulletin of the Novosibirsk State Technical University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17212/1814-1196-2020-4-65-80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在制定生产计划的过程中,一个重要的步骤是安排工艺操作的执行。时间表可以手工创建,也可以使用软件创建。如果调度是由软件编制的,则使用几种调度生成算法来消除可能的误差。一组这样的算法被称为“批处理”。建议在批处理中只包含不同的算法。这对于消除同类错误是必要的。因此,在批量中搜索算法的克隆是一项紧迫的生产任务。为了解决这一问题,在此工作过程中开发了一种多样性度量算法。这样的数值度量(如百分比)决定了算法的差异。这个度量是基于算法执行的属性。利用得到的点在n维空间中构造算法轨迹。跟踪点的坐标是算法在执行的每一步或算法执行的每个控制点所使用的值。通过实验验证了该指标的正确性。在本实验中,计算了三种排序算法的轨迹特性。基于所获得的性质,确定了度量空间中比较算法的指标。实验验证了利用多样性度量在算法批处理中查找克隆的有效性。这个指标的范围并不局限于克隆搜索。它可以作为软件质量的独立指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An assessment of the algorithm difference measure in a multivariate system for production plans scheduling
In the process of designing a production plan, one of the important steps is scheduling the execution of technological operations. The schedule can be created either manually or by using software. If the schedule is compiled by software, then several schedule generation algorithms are used to eliminate possible errors. A set of such algorithms is called a "batch". It is advisable that only different algorithms should be included in the batch. This is necessary to eliminate errors of the same type. Therefore, the search for clones of algorithms in the batch is an urgent production task. To solve it a diversity metric of algorithms was developed in the course of this work. Such a metric numerically (as a percentage) determines how much the algorithms differ. This metric is based on the properties of the algorithm execution. Algorithm traces are constructed in the N-dimensional space using the obtained points. The coordinates of the trace points are the values with which the algorithm works at each step of its execution or each of the control points of the algorithm execution. An experiment was performed to confirm the correctness of this metric. Within this experiment, the trace properties of three sorting algorithms were calculated. Based on the properties obtained, indicators were determined for comparing algorithms in the metric space. The experiment confirmed the effectiveness of using the diversity metric to find clones in the algorithms batch. The scope of this metric is not limited to clone searches. It can be used as an independent indicator of software quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信