.png){kind=icon}
Return
A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.07.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a Multi-Objective Genetic Algorithm (MOGA) approach to a Just-In-Time (JIT) sequencing problem where variation of production rates and number of setups are to be optimized simultaneously. These two objectives are typically inversely correlated with each other, and therefore, simultaneously optimization of both is challenging. Moreover, this type of problem is NP-hard, hence attainment of IP/LP solutions, or solutions via Total Enumeration (TE) is computationally prohibitive. The MOGA approach searches for locally Pareto-optimal or locally non-dominated frontier where simultaneous minimization of the production rates variation and the number of setups is desired. Performance of the proposed MOGA was compared against a TE scheme in small problems and also against three other search heuristics in small, medium and large problems. Experimental results show that the MOGA performs very well when compared against TE in a considerably shorter time. It also outperforms the comparator algorithms in terms of quality of solutions at the same level of diversity in reasonable amount of CPU time. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
mixed-model sequencing
Just-In-Time
Pareto-optimal frontier
Multi-Objective Genetic Algorithms
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
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more