在混合模型装配线中最小化复杂性的顺序规划

Xiaowei Zhu, S. Jack Hu, Y. Koren, Samuel P. Marin, N. Huang
{"title":"在混合模型装配线中最小化复杂性的顺序规划","authors":"Xiaowei Zhu, S. Jack Hu, Y. Koren, Samuel P. Marin, N. Huang","doi":"10.1109/ISAM.2007.4288481","DOIUrl":null,"url":null,"abstract":"Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.","PeriodicalId":166385,"journal":{"name":"2007 IEEE International Symposium on Assembly and Manufacturing","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines\",\"authors\":\"Xiaowei Zhu, S. Jack Hu, Y. Koren, Samuel P. Marin, N. Huang\",\"doi\":\"10.1109/ISAM.2007.4288481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.\",\"PeriodicalId\":166385,\"journal\":{\"name\":\"2007 IEEE International Symposium on Assembly and Manufacturing\",\"volume\":\"147 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Assembly and Manufacturing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAM.2007.4288481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Assembly and Manufacturing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAM.2007.4288481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

序列规划是装配线设计中的一个重要问题。它用于确定要按顺序执行的组装任务的顺序。根据不同的标准,如工艺时间、投资成本和产品质量,已经做了大量的研究来找到好的序列。本文讨论了混合装配线中基于产品种类带来的复杂性的最优序列选择问题。复杂性被定义为操作员选择复杂性,它间接衡量了在多产品、多阶段、人工装配环境中,人类在选择零件、工具、夹具和装配程序等方面的表现。装配线的复杂性度量及其模型已在作者较早的论文中提出。根据所建立的复杂性模型,装配序列决定了复杂性的流动方向。因此,合理的装配顺序规划可以降低装配的复杂性。然而,由于优化过程中复杂流的方向处理困难,建立了一种转换后的网络流模型,并基于动态规划进行求解。本文开发的方法扩展了先前的建模复杂性工作,并为装配序列规划提供了最小化复杂性的解决方案策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines
Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Collision Detection Method for the Scaled Convex Polyhedral Objects with Relative Motion Manufacturing Multiagent System for Scheduling Optimization of Production Tasks Using Dynamic Genetic Algorithms A Method for Measurement and Characterization of Microdispensing Process ASSEMIC: Handling and Assembly in the Micro dimension Disassembly Precedence Graph Generation
×
引用
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