{"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}
引用次数: 68
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.