并行和顺序操作的传输线优化设计问题

A. Dolgui, N. Guschinbsky, G. Levin
{"title":"并行和顺序操作的传输线优化设计问题","authors":"A. Dolgui, N. Guschinbsky, G. Levin","doi":"10.1109/ETFA.1999.815373","DOIUrl":null,"url":null,"abstract":"A problem of optimal design for a class of automatic production systems is considered. The investigated systems are transfer lines without buffers and with parallel and sequential operations at each workstation. Manufacturing operations for a workstation are partitioned into blocks. All operations of the same block are performed simultaneously, and different blocks are executed sequentially. The relations of necessity and possibility of combining operations in one block and in one workstation as well as precedence constraints are given. Operation time of a block depends of assigned operations, while the operation time of a workstation is the sum of operation times of its blocks. The problem is to minimize the weighted total number of workstations and blocks, providing a given cycle time and satisfying the above constraints. The proposed method is based on reducing the initial problem to the shortest constraint path problem.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"68","resultStr":"{\"title\":\"On problem of optimal design of transfer lines with parallel and sequential operations\",\"authors\":\"A. Dolgui, N. Guschinbsky, G. Levin\",\"doi\":\"10.1109/ETFA.1999.815373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A problem of optimal design for a class of automatic production systems is considered. The investigated systems are transfer lines without buffers and with parallel and sequential operations at each workstation. Manufacturing operations for a workstation are partitioned into blocks. All operations of the same block are performed simultaneously, and different blocks are executed sequentially. The relations of necessity and possibility of combining operations in one block and in one workstation as well as precedence constraints are given. Operation time of a block depends of assigned operations, while the operation time of a workstation is the sum of operation times of its blocks. The problem is to minimize the weighted total number of workstations and blocks, providing a given cycle time and satisfying the above constraints. The proposed method is based on reducing the initial problem to the shortest constraint path problem.\",\"PeriodicalId\":119106,\"journal\":{\"name\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"68\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.1999.815373\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.1999.815373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 68

摘要

研究了一类自动化生产系统的优化设计问题。所研究的系统是没有缓冲区的传输线,每个工作站都有并行和顺序操作。工作站的制造操作被划分为块。同一块的所有操作同时执行,不同的块依次执行。给出了一区一站组合作业的必要性和可能性关系以及优先约束条件。块的操作时间取决于分配的操作,而工作站的操作时间是其块操作次数的总和。问题是在提供给定的周期时间并满足上述约束的情况下,最小化工作站和块的加权总数。该方法基于将初始问题简化为最短约束路径问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On problem of optimal design of transfer lines with parallel and sequential operations
A problem of optimal design for a class of automatic production systems is considered. The investigated systems are transfer lines without buffers and with parallel and sequential operations at each workstation. Manufacturing operations for a workstation are partitioned into blocks. All operations of the same block are performed simultaneously, and different blocks are executed sequentially. The relations of necessity and possibility of combining operations in one block and in one workstation as well as precedence constraints are given. Operation time of a block depends of assigned operations, while the operation time of a workstation is the sum of operation times of its blocks. The problem is to minimize the weighted total number of workstations and blocks, providing a given cycle time and satisfying the above constraints. The proposed method is based on reducing the initial problem to the shortest constraint path problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信