Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm
Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm
复制标题
DOI：
10.1155/2016/4536426
复制
发表时间：
2016-06
影响因子：
--
通讯作者：
Zixiang Li;Qiuhua Tang;Liping Zhang
中科院分区：
文献类型：
--
作者：
Zixiang Li;Qiuhua Tang;Liping Zhang
双边装配线平衡问题（TALBP-II）对于广泛应用于大尺寸、大批量产品装配的双边装配线的重构具有重要意义。TALBP-II是np困难的，实际应用程序中的一些分配限制使这个问题更加复杂。本文给出了最优求解具有赋值限制的TALBP-II问题的整数规划模型，并利用简单有效的迭代贪婪（IG）算法求解大规模问题。该算法通过考虑任务间的优先级关系，采用一种新的局部搜索方法，以减少计算时间。特别是，开发了一种基于优先级的解码方案来处理这些分配限制，并通过调整优先级值来减少与序列相关的空闲时间。将所提出的解码方案与其他已发表的解码方案进行实验比较，证明了基于优先级的解码方案的有效性。通过对IG算法与其他八种最新算法的综合计算比较，证明了本文算法的有效性。
The two-sided assembly line balancing problem type-II (TALBP-II) is of major importance for the reconfiguration of the two-sided assembly lines which are widely utilized to assemble large-size high-volume products. The TALBP-II is NP-hard, and some assignment restrictions in real applications make this problem much more complex. This paper provides an integer programming model for solving the TALBP-II with assignment restrictions optimally and utilizes a simple and effective iterated greedy (IG) algorithm to address large-size problems. This algorithm utilizes a new local search by considering precedence relationships between tasks in order to reduce the computational time. In particular, a priority-based decoding scheme is developed to handle these assignment restrictions and reduce sequence-dependent idle times by adjusting the priority values. Experimental comparison among the proposed decoding scheme and other published ones demonstrates the efficiency of the priority-based decoding. A comprehensive computational comparison among the IG algorithm and other eight recent algorithms proves effectiveness of the proposed IG algorithm.