.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Assembly cell
Assembly line
Line-cell conversion
Multi-objective optimization
Genetic algorithm
Seru
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveCombining local search into non-dominated sorting for multi-objective line-cell conversion problem
PREAI
ShareSaveShareSaveShareSaveAn effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
PREAI
ShareSave
ShareSave
View more