A Method Of Assembly Line Balancing Problem With Uncertain Operation Time

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
作业时间不确定的装配线平衡问题的一种方法
装配线平衡问题是大批量生产系统中的一个重要问题。为了解决实际存在但文献中鲜有提及的不确定性问题,本文提出了求解具有不确定性作业时间的装配线平衡问题的数学模型和优化算法。所建立的模型能够在不确定环境下使用可变工位,以达到工位数量最少,每台工位空闲时间最少为目标。特别地,该方法首先引入了保护时间的概念,该概念与不确定的操作时间密切相关。随后提出了4个优势规则和上下界的确定机制,作为所提出的分支定界算法的基础。实验结果表明,该方法在基准数据集上得到了验证,能够有效地解决不确定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Incremental Learning for Transductive SVMs ISKE 2019 Table of Contents Consensus: The Minimum Cost Model based Robust Optimization A Learned Clause Deletion Strategy Based on Distance Ratio Effects of Real Estate Regulation Policy of Beijing Based on Discrete Dependent Variables Model
×
引用
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