基于迭代束搜索的固定工位简单装配线平衡
Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations
摘要：
简单装配线平衡问题（SALBP）涉及的任务分配与预定义的处理时间的工作站安排在一条线上。因此，必须尊重任务之间的优先约束。优化目标的SALBP-2版本的问题涉及的所谓的周期时间，即，在每个工作站的任务必须完成的时间最小化。在这项工作中，我们提出了解决这个问题的迭代搜索方法的基础上束搜索。该算法能够获得最佳的，分别是最知名的，解决方案在283 302个测试用例。此外，对于9个进一步的测试用例，该算法能够产生新的最佳已知的解决方案。这些数字表明，所提出的迭代束搜索算法是目前SALBP-2的最先进的方法。
英文摘要：
The simple assembly line balancing problem (SALBP) concerns the assignment of tasks with pre-defined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be respected. The optimization goal of the SALBP-2 version of the problem concerns the minimization of the so-called cycle time, that is, the time in which the tasks of each work station must be completed. In this work we propose to tackle this problem with an iterative search method based on beam search. The proposed algorithm is able to obtain optimal, respectively best-known, solutions in 283 out of 302 test cases. Moreover, for 9 further test cases the algorithm is able to produce new best-known solutions. These numbers indicate that the proposed iterative beam search algorithm is currently a state-of-the-art method for the SALBP-2.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
