.png){kind=icon}
返回
Integer based formulation for the simple assembly line balancing problem with multiple identical tasks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.12.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Assembly lines, especially those with welding procedures, can present several tasks with the same properties. These tasks can be treated as tasks with replicas, simplifying the problem. A Mixed Integer Linear Programming model is presented for the Simple Assembly Line Balancing Problem with Multiple Identical Tasks (or Repeated Tasks). Integer variables were used to define the number of identical tasks performed in each station. Along with variable reduction rules, the compact formulation presents only a fraction of the variables of equivalent binary models when several repeated tasks are present. Three instances inspired in real assembly lines and adapted benchmark problems with repeated tasks are used to compare the formulations. Using a universal solver, the integer formulation outperformed the binary formulation for the vast majority of instances and achieved competitive results in relation to the efficient procedure SALOME-2 (a dedicated algorithm based on branch-and-bound for Simple Assembly Line Balancing Problem). Grouping identical tasks proved to simplify the problem, allowing the procedure to solve larger instances. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Assembly line balancing
Mixed integer linear programming
Identical tasks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容