基于Petri网和遗传算法的作业车间制造系统最优调度

A. Yao, Y. Pan
{"title":"基于Petri网和遗传算法的作业车间制造系统最优调度","authors":"A. Yao, Y. Pan","doi":"10.1109/ICSSE.2013.6614640","DOIUrl":null,"url":null,"abstract":"An optimal production scheduling solution to meet the order is a must for enterprise to gain profit. This paper presents a novel Petri nets and Genetic Algorithm (PNGA) optimal scheduling method for job shop manufacturing systems. Using the job shop production of a mold factory as a case study, we examined the capability of the proposed PNGA method and compared its results with the ordinary Genetic Algorithm (GA) and Hybrid Taguchi-Genetic Algorithm (HTGA) methods. The MATLAB software was adopted to model the Petri nets in this study. Taguchi's method was used to optimize these experiment parameters. The optimal parameter settings were then programmed into the PNGA program. In conjunction with the Petri nets model, the process time was then estimated. The simulation results show that the average process time of PNGA is about 287 (unit time). It is less than 289.55 of the GA and 288.8 of the HTGA. The standard deviation of process time of PNGA is about 5.20. It is less than 6.0 of the GA and 5.88 of the HTGA. That is, the proposed PNGA is able to provide a better production scheduling solution.","PeriodicalId":124317,"journal":{"name":"2013 International Conference on System Science and Engineering (ICSSE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Petri nets and genetic algorithm based optimal scheduling for job shop manufacturing systems\",\"authors\":\"A. Yao, Y. Pan\",\"doi\":\"10.1109/ICSSE.2013.6614640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal production scheduling solution to meet the order is a must for enterprise to gain profit. This paper presents a novel Petri nets and Genetic Algorithm (PNGA) optimal scheduling method for job shop manufacturing systems. Using the job shop production of a mold factory as a case study, we examined the capability of the proposed PNGA method and compared its results with the ordinary Genetic Algorithm (GA) and Hybrid Taguchi-Genetic Algorithm (HTGA) methods. The MATLAB software was adopted to model the Petri nets in this study. Taguchi's method was used to optimize these experiment parameters. The optimal parameter settings were then programmed into the PNGA program. In conjunction with the Petri nets model, the process time was then estimated. The simulation results show that the average process time of PNGA is about 287 (unit time). It is less than 289.55 of the GA and 288.8 of the HTGA. The standard deviation of process time of PNGA is about 5.20. It is less than 6.0 of the GA and 5.88 of the HTGA. That is, the proposed PNGA is able to provide a better production scheduling solution.\",\"PeriodicalId\":124317,\"journal\":{\"name\":\"2013 International Conference on System Science and Engineering (ICSSE)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on System Science and Engineering (ICSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSE.2013.6614640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on System Science and Engineering (ICSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSE.2013.6614640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

一个满足订单的最优生产调度方案是企业获取利润的必要条件。提出了一种基于Petri网和遗传算法(PNGA)的作业车间制造系统优化调度方法。以某模具厂作业车间生产为例,验证了所提出的PNGA方法的性能,并将其与普通遗传算法(GA)和混合田口遗传算法(HTGA)方法进行了比较。本研究采用MATLAB软件对Petri网进行建模。采用田口法对实验参数进行优化。然后将最佳参数设置编程到PNGA程序中。结合Petri网模型,估算了过程时间。仿真结果表明,PNGA的平均处理时间约为287(单位时间)。低于GA的289.55和HTGA的288.8。PNGA工艺时间的标准差约为5.20。低于GA的6.0和HTGA的5.88。也就是说,所提出的PNGA能够提供更好的生产调度解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Petri nets and genetic algorithm based optimal scheduling for job shop manufacturing systems
An optimal production scheduling solution to meet the order is a must for enterprise to gain profit. This paper presents a novel Petri nets and Genetic Algorithm (PNGA) optimal scheduling method for job shop manufacturing systems. Using the job shop production of a mold factory as a case study, we examined the capability of the proposed PNGA method and compared its results with the ordinary Genetic Algorithm (GA) and Hybrid Taguchi-Genetic Algorithm (HTGA) methods. The MATLAB software was adopted to model the Petri nets in this study. Taguchi's method was used to optimize these experiment parameters. The optimal parameter settings were then programmed into the PNGA program. In conjunction with the Petri nets model, the process time was then estimated. The simulation results show that the average process time of PNGA is about 287 (unit time). It is less than 289.55 of the GA and 288.8 of the HTGA. The standard deviation of process time of PNGA is about 5.20. It is less than 6.0 of the GA and 5.88 of the HTGA. That is, the proposed PNGA is able to provide a better production scheduling solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Clustering of text collections based on PART neural network and similarity measure Target object announcement by synchronous blinking of a robot and an object Design and implementation of adaptive dynamic controllers for wheeled mobile robots Applying weighted mean aggregation to edge detection of images Adaptive dynamic surface control for fault-tolerant multi-robot systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1