.png){kind=icon}
返回
Mathematical analysis and solutions for multi-objective line-cell conversion problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.01.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The line-cell (or line-seru) conversion is an innovation of assembly system applied widely in the electronics industry. Its essence is tearing out an assembly line and adopting a mini-assembly unit, called seru (or Japanese style assembly cell). In this paper, we develop a multi-objective optimization model to investigate two line-cell conversion performances: the total throughput time (TTPT) and the total labor hours (TLH). We analyze the bi-objective model to find out its mathematical characteristics such as solution space, combinatorial complexity and non-convex properties, and others. Owing to the difficulties of the model, a non-dominated sorting genetic algorithm that can solve large size problems in a reasonable time is developed. To verify the reliability of the algorithm, solutions are compared with those obtained from the enumeration method. We find that the proposed genetic algorithm is useful and can get reliable solutions in most cases. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Assembly cell
Assembly line
Line-cell conversion
Multi-objective optimization
Genetic algorithm
Seru
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Combining local search into non-dominated sorting for multi-objective line-cell conversion problem
PREAI
分享收藏An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems多目标柔性作业车间调度问题的有效混合优化方法
PREAI
分享收藏
分享收藏
查看更多内容