首页> 外文期刊>Brazilian Journal of Operations and Production Management >Using metaheuristic algorithms for solving a mixed model assembly line balancing problem considering express parallel line and learning effect
【24h】

Using metaheuristic algorithms for solving a mixed model assembly line balancing problem considering express parallel line and learning effect

机译:考虑表达平行线和学习效果,使用沟培算法来解决混合模型装配线平衡问题

获取原文
           

摘要

Mixed-model assembly line attracts many manufacturing centers' attentions, since it enables them to manufacture different models of one product in the same line. The present work proposes a new mathematical model to balancing mixed-model assembly two parallel lines, in which first one is a common line and the other is an express line due to more modern technology or operators with higher skills. Therefore, the cost of equipment and skilled labor in the express line is higher, and also, the learning effect on resource dependent task times and setup times is considered in the assemble-to-order environment. The aim of this study is to minimize the cycle time and the total operating cost and smoothness index by configuration of tasks in stations, according to their precedence diagrams. Also, assigning the assistants to some tasks in some stations and for some models is allowed. This problem is categorized as an NP-hard problem and for solving this multi-objective problem, non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective particle swarm optimization (MOPSO) are applied. Finally, for comparing the proposed methods some numerical examples are implemented and the result show that MOPSO outperforms NSGAII.
机译:混合模型装配线吸引了许多制造中心的关注,因为它使它们能够在同一条线上制造不同型号的一个产品。本工作提出了一种对平衡混合模型组装的新数学模型进行两个平行线,其中第一个是公共线,另一条是由于更多现代技术或具有更高技能的操作员的快速线。因此,Express行中的设备和熟练劳动力的成本更高,而且,在组装对环境中考虑对资源相关任务时间和设置时间的学习效果。本研究的目的是根据其优先级,通过在站中配置任务来最小化循环时间和总运营成本和平滑度指数。此外,将助手分配给某些站点中的某些任务和某些型号。该问题被分类为NP - 硬质问题,并且为了解决这种多目标问题,应用非主导的分类遗传算法II(NSGA-II)和多目标粒子群优化(MOPSO)。最后,为了比较所提出的方法,实施了一些数值例子,结果表明MOPSO优于NSGaii。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号