Zhongmin Wang, Lin Wei, Hengshan Zhang, Tianhua Chen, Yimin Zhou
{"title":"A Method Of Assembly Line Balancing Problem With Uncertain Operation Time","authors":"Zhongmin Wang, Lin Wei, Hengshan Zhang, Tianhua Chen, Yimin Zhou","doi":"10.1109/ISKE47853.2019.9170418","DOIUrl":null,"url":null,"abstract":"The assembly line balancing problems are significant in mass production systems. In order to solve the uncertainties that practically exist but barely mentioned in the literature,this paper proposed a mathematical model with an optimization algorithm to solve the assembly line balancing problem with uncertainty operation time. The developed model is able to work with variable number of workstations under the uncertain environment, aiming to reach the minimal number of workstation and minimize idle time for each workstation. In particular, the proposed approach first introduces the concept of protection time that closely works with the uncertain operation time.Four dominance rules and the mechanism of determining up and low bounds are subsequently put forward, which serve as the basis for the proposed branch and bound algorithm. And experimental results show the proposed work verified on a benchmark data set is able to solve the uncertainties efficiently.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The assembly line balancing problems are significant in mass production systems. In order to solve the uncertainties that practically exist but barely mentioned in the literature,this paper proposed a mathematical model with an optimization algorithm to solve the assembly line balancing problem with uncertainty operation time. The developed model is able to work with variable number of workstations under the uncertain environment, aiming to reach the minimal number of workstation and minimize idle time for each workstation. In particular, the proposed approach first introduces the concept of protection time that closely works with the uncertain operation time.Four dominance rules and the mechanism of determining up and low bounds are subsequently put forward, which serve as the basis for the proposed branch and bound algorithm. And experimental results show the proposed work verified on a benchmark data set is able to solve the uncertainties efficiently.