.png){kind=icon}
返回
A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-011-0570-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To improve capital effectiveness in light of demand fluctuation, it is increasingly important for high-tech companies to develop effective solutions for managing multiple resources involved in the production. To model and solve the simultaneous multiple resources scheduling problem in general, this study aims to develop a genetic algorithm (bvGA) incorporating with a novel bi-vector encoding method representing the chromosomes of operation sequence and seizing rules for resource assignment in tandem. The proposed model captured the crucial characteristics that the machines were dynamic configuration among multiple resources with limited availability and sequence-dependent setup times of machine configurations between operations would eventually affect performance of a scheduling plan. With the flexibility and computational intelligence that GA empowers, schedule planners can make advanced decisions on integrated machine configuration and job scheduling. According to a number of experiments with simulated data on the basis of a real semiconductor final testing facility, the proposed bvGA has shown practical viability in terms of solution quality as well as computation time.
Keyword:
Total resource management
Manufacturing management
Flexible manufacturing systems
Scheduling
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
An approach to regulating machine sharing in reconfigurable back-end semiconductor manufacturing
PREAI
分享收藏
查看更多内容