.png){kind=icon}
返回
A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(98)00026-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sequencing problems are important for an efficient use of mixed model assembly lines. There is a rich set of criteria on which to judge sequences of product models in terms of line utilization. We consider three practically important objectives: minimizing total utility work, keeping a constant rate of part usage and minimizing total setup cost. A considerate line manager would like to take into account all these factors. The multiple objective sequencing problem is described and its mathematical formulation is provided. A genetic algorithm is designed for finding near-Pareto or Pareto optimal solutions for the problem. A new genetic evaluation and selection mechanism, called Pareto stratum-niche cubicle, is proposed. The performance comparison of the proposed genetic algorithm with three existing genetic algorithms is made for various test-bed problems in terms of solution quality and diversity. The results reveal that the proposed genetic algorithm outperforms the existing genetic algorithms, especially for problems that are large and involve great variation in setup cost. (C) 1998 Elsevier Science Ltd. Ail rights reserved.
Keyword:
mixed model assembly lines
genetic algorithm
multiple objectives
sequencing problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Characteristics of the Raman spectra of diamond-like carbon films. Influence of methods of synthesis
PREAI
分享收藏Metabolomic profiling of ascending thoracic aortic aneurysms and dissections - Implications for pathophysiology and biomarker discovery.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
查看更多内容