{"title":"构造等价于一组给定装配序列的优先图","authors":"V. Mînzu, A. Bratcu, J. Henrioud","doi":"10.1109/ISATP.1999.782928","DOIUrl":null,"url":null,"abstract":"Precedence graphs are used in assembly systems design, tasks-to-workstations assignment algorithms and resource planning. Despite that, no systematic obtaining method for these graphs has been proposed. On the other hand, there are very efficient methods to generate assembly sequences and a precedence graph can be obtained by \"merging\" assembly sequences. In the paper, a property of a given set of assembly sequences is found, that guarantees the existence of an \"equivalent\" precedence graph. This result can be used for the general case, when this property is not met.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Construction of the precedence graphs equivalent to a given set of assembly sequences\",\"authors\":\"V. Mînzu, A. Bratcu, J. Henrioud\",\"doi\":\"10.1109/ISATP.1999.782928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Precedence graphs are used in assembly systems design, tasks-to-workstations assignment algorithms and resource planning. Despite that, no systematic obtaining method for these graphs has been proposed. On the other hand, there are very efficient methods to generate assembly sequences and a precedence graph can be obtained by \\\"merging\\\" assembly sequences. In the paper, a property of a given set of assembly sequences is found, that guarantees the existence of an \\\"equivalent\\\" precedence graph. This result can be used for the general case, when this property is not met.\",\"PeriodicalId\":326575,\"journal\":{\"name\":\"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISATP.1999.782928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISATP.1999.782928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of the precedence graphs equivalent to a given set of assembly sequences
Precedence graphs are used in assembly systems design, tasks-to-workstations assignment algorithms and resource planning. Despite that, no systematic obtaining method for these graphs has been proposed. On the other hand, there are very efficient methods to generate assembly sequences and a precedence graph can be obtained by "merging" assembly sequences. In the paper, a property of a given set of assembly sequences is found, that guarantees the existence of an "equivalent" precedence graph. This result can be used for the general case, when this property is not met.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
