arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.3676cs.DScs.NE
收藏

装配线工人分配和平衡问题的简单算法

Simple heuristics for the assembly line worker assignment and balancing problem

Mayron César O. Moreira, Marcus Ritt, Alysson M. Costa, Antonio A. Chaves

摘要:

我们提出了简单的装配线工人分配和平衡问题的算法。这个问题通常发生在残疾人庇护工作中心的装配线上。与经典的简单装配线平衡问题不同,任务的执行时间根据分配的工人而变化。我们开发了一个建设性的启发式框架的基础上,任务和工人的优先级规则定义的任务和工人应该被分配到工作站的顺序。我们提出了一些这样的规则,并比较它们的性能在三个可能的用途:作为一个独立的方法,作为一个初始的解决方案生成器元算法,并作为一个解码器的混合遗传算法。我们的研究结果表明,算法是快速的,它们作为一个独立的方法获得了良好的结果,并作为一个初始的解决方案生成器或作为一个解决方案的解码器在更复杂的方法是有效的。

英文摘要:

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑