在自动化生产系统中选择工艺方案

A. Kusiak, G. Finke
{"title":"在自动化生产系统中选择工艺方案","authors":"A. Kusiak, G. Finke","doi":"10.1109/56.803","DOIUrl":null,"url":null,"abstract":"Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed. >","PeriodicalId":370047,"journal":{"name":"IEEE J. Robotics Autom.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":"{\"title\":\"Selection of process plans in automated manufacturing systems\",\"authors\":\"A. Kusiak, G. Finke\",\"doi\":\"10.1109/56.803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed. >\",\"PeriodicalId\":370047,\"journal\":{\"name\":\"IEEE J. Robotics Autom.\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"64\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE J. Robotics Autom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/56.803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE J. Robotics Autom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/56.803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

摘要

大多数自动化制造系统的计划模型都是基于这样的假设,即每个零件只有一个可用的工艺计划。更现实的观点是,对于每个零件,生成许多不同的工艺计划,每个工艺计划可能需要特定类型的工具和辅助设备,如夹具、夹具和送料器。建立了相应制造成本最小、工具和辅助装置数量最少的工艺方案选择模型。所建立的m个零件的模型等价于在m部图中以最小的代价求最大团的问题。讨论了启发式算法和数值结果。>
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Selection of process plans in automated manufacturing systems
Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed. >
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信