{"title":"材料回收和零件再利用的最优拆卸顺序生成","authors":"A. Lambert","doi":"10.1109/ISATP.1999.782950","DOIUrl":null,"url":null,"abstract":"From graphical methods for optimal disassembly sequence generation, a new concept is applied based on mathematical programming. The method described enhances flexibility and offers the possibility of extension of the original problem. This paper discusses optimal disassembly sequence generation and illustrates some of its possibilities by considering an instructive case.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Optimal disassembly sequence generation for combined material recycling and part reuse\",\"authors\":\"A. Lambert\",\"doi\":\"10.1109/ISATP.1999.782950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"From graphical methods for optimal disassembly sequence generation, a new concept is applied based on mathematical programming. The method described enhances flexibility and offers the possibility of extension of the original problem. This paper discusses optimal disassembly sequence generation and illustrates some of its possibilities by considering an instructive case.\",\"PeriodicalId\":326575,\"journal\":{\"name\":\"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"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.782950\",\"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.782950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal disassembly sequence generation for combined material recycling and part reuse
From graphical methods for optimal disassembly sequence generation, a new concept is applied based on mathematical programming. The method described enhances flexibility and offers the possibility of extension of the original problem. This paper discusses optimal disassembly sequence generation and illustrates some of its possibilities by considering an instructive case.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
