.png){kind=icon}
返回
A branch, bound, and remember algorithm for the simple disassembly line balancing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2019.01.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we deal with a disassembly line balancing problem (DLBP), using an AND/OR graph (AOG) to represent the precedence relations between tasks. The decision maker needs to select a proper processing alternative and assign the corresponding tasks among stations to minimise the number of stations, without violating the cycle time constraint and the precedence relations. The problem was first formulated by Koc et al. (2009) and is denoted as type 1 simple DLBP (SDLBP-1) in this study. We prove that an SDLBP-1 with no parallel tasks is polynomially solvable and develop a branch, bound, and remember (BB&R) algorithm for the general SDLBP-1 with parallel tasks. Moreover, two lower bounding schemes, a strengthened Koc's integer programming (IP) model and a new benchmark instance generation scheme are proposed. Computational results show that the BB&R algorithm is the state-of-the-art exact algorithm for SDLBP-1, and that it can be easily truncated into a state-of-the-art heuristic which optimally solves most instances in very short time. In addition, the lower bounds and the strengthened IP model are also demonstrated to be effective. (C) 2019 Published by Elsevier Ltd.
Keyword:
Disassembly line balancing
Lower bound
Branch and bound
Heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Multi-objective optimization of stochastic disassembly line balancing with station paralleling车站平行随机拆解线平衡的多目标优化
PREAI
分享收藏分享收藏Second order conic approximation for disassembly line design with joint probabilistic constraints
OAAI
OAAI分享收藏A spatiotemporal dipole model of the stimulus preceding negativity (spn) prior to feedback stimuli
PREAI
分享收藏
分享收藏
查看更多内容