Robust disassembly line balancing with ambiguous task processing times
Robust disassembly line balancing with ambiguous task processing times
复制标题
稳健的拆卸线平衡与模糊的任务处理时间
DOI：
10.1080/00207543.2019.1659520
复制
发表时间：
2019
影响因子：
9.2
通讯作者：
Chu Chengbin
中科院分区：
文献类型：
--
作者：
Liu Ming;Liu Xin;Chu Feng;Zheng Feifeng;Chu Chengbin
拆卸线平衡问题是指拆卸工序的选择、工作站的打开以及任务的分配问题，在报废产品的回收中起着重要的作用。在现实世界的拆卸操作中，由于各种因素，任务处理时间通常是随机的。大多数相关的工作解决不确定的处理时间，假设概率分布是已知的，任务的处理时间是相互独立的。然而，在实际应用中，很难得到完整的分布信息，并且不确定的加工时间之间总是存在潜在的相关性。研究了具有部分不确定性知识的DLBP问题，即任务处理时间的均值和协方差矩阵。提出了一种新的具有联合机会约束的分布鲁棒公式。为了解决该问题，提出了一个近似的混合整数二阶锥规划（MI-SOCP）模型，并进一步发展了一个两阶段的参数调整启发式算法。数值实验进行，以评估所提出的方法的性能。我们还得出一些管理的见解，并考虑扩展问题。
Disassembly line balancing problem (DLBP), which is to select disassembly process, open workstations and assign selected tasks to opened workstations, plays an important role in the recycling of End Of Life products. In real-world disassembly operations, task processing times are usually stochastic due to various factors. Most related works address the uncertain processing times by assuming that the probability distribution is known and the task processing times are independent of each other. In practice, however, it is difficult to get the complete distributional information and there is always underlying correlation between the uncertain processing times. This paper investigates the DLBP with partial uncertain knowledge, i.e. the mean and covariance matrix of task processing times. A new distributionally robust formulation with a joint chance constraint is proposed. To solve the problem, an approximated mixed integer second-order cone programming (MI-SOCP) model is proposed, and a two-stage parameter-adjusting heuristic is further developed. Numerical experiments are conducted, to evaluate the performance of the proposed method. We also draw some managerial insights and consider an extension problem.