多机器人作业车间问题的启发式构造算法。等约束

Saad Louaqad, Oualid Kamach
{"title":"多机器人作业车间问题的启发式构造算法。等约束","authors":"Saad Louaqad, Oualid Kamach","doi":"10.1109/CIST.2014.7016599","DOIUrl":null,"url":null,"abstract":"The work presented in this article focuses on the problem of job shop with different handling robots and subject to some constraints of blocking and no.-wait. The blocking constraint models the lack of storage capacity whereas the constraint of No.-wait appears when two consecutive operations should be performed without interruption. Jobs must be transported between machines by different handling robots. In this type of problem, deadlock situations where the system becomes paralyzed may appear. In this paper, we present a method based on graph theory which helps prevent the blocking states during schedule construction. The calculation of transportation operations starting times is also illustrated. Finally, we propose an algorithm for the construction of a heuristic based on priority rules to minimize the total execution time that is defined by the makespan.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Heuristic construction algorithm for the job shop problem with several robots and subject to blocking and no.-wait constraint\",\"authors\":\"Saad Louaqad, Oualid Kamach\",\"doi\":\"10.1109/CIST.2014.7016599\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The work presented in this article focuses on the problem of job shop with different handling robots and subject to some constraints of blocking and no.-wait. The blocking constraint models the lack of storage capacity whereas the constraint of No.-wait appears when two consecutive operations should be performed without interruption. Jobs must be transported between machines by different handling robots. In this type of problem, deadlock situations where the system becomes paralyzed may appear. In this paper, we present a method based on graph theory which helps prevent the blocking states during schedule construction. The calculation of transportation operations starting times is also illustrated. Finally, we propose an algorithm for the construction of a heuristic based on priority rules to minimize the total execution time that is defined by the makespan.\",\"PeriodicalId\":106483,\"journal\":{\"name\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIST.2014.7016599\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2014.7016599","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文主要研究不同搬运机器人的作业车间问题,并受阻塞和不等待约束。阻塞约束模拟了存储容量的不足,而No约束模拟了存储容量的不足。当需要连续执行两个操作时,出现-wait。作业必须由不同的搬运机器人在机器之间搬运。在这种类型的问题中,可能出现系统瘫痪的死锁情况。本文提出了一种基于图论的方法来防止调度过程中的阻塞状态。并举例说明了运输作业起始时间的计算。最后,我们提出了一种基于优先级规则构建启发式算法的算法,以最小化由makespan定义的总执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Heuristic construction algorithm for the job shop problem with several robots and subject to blocking and no.-wait constraint
The work presented in this article focuses on the problem of job shop with different handling robots and subject to some constraints of blocking and no.-wait. The blocking constraint models the lack of storage capacity whereas the constraint of No.-wait appears when two consecutive operations should be performed without interruption. Jobs must be transported between machines by different handling robots. In this type of problem, deadlock situations where the system becomes paralyzed may appear. In this paper, we present a method based on graph theory which helps prevent the blocking states during schedule construction. The calculation of transportation operations starting times is also illustrated. Finally, we propose an algorithm for the construction of a heuristic based on priority rules to minimize the total execution time that is defined by the makespan.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信