.png){kind=icon}
返回
Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2022.2118888.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the optimisation of Mixed-model assembly lines with continuous paced line control. The two minimisation goals have a mixed-integer linear multi-objective dispute. The paper proposes a criterion-space method to define the Pareto front for this class of problems. The method combines Pareto fronts obtained from integer solutions and gradually refines them until the instance's global front is determined. Comparing paced to unpaced line controls can be challenging, since they can produce the same cycle time given sufficiently long line lengths or buffers. Hence, determining Pareto fronts between cycle time and line length for paced lines allows meaningful comparisons between line controls. An industrial case study shows that line length acts as continuously distributable buffers for paced lines, leading to weaker diminishing returns. This result suggests that paced lines are more efficient than unpaced ones for lower cycle time ranges.
Keyword:
Assembly line balancing
mixed-model sequencing
cyclical scheduling
multi-objective optimisation
Pareto front
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case混合0-1线性规划的多目标分支和界限: 对双目标情况的修正和改进
PREAI
分享收藏分享收藏
查看更多内容