.png){kind=icon}
返回
A binary coding genetic algorithm for multi-purpose process scheduling: A case study
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ces.2010.05.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel genetic algorithm (GA) for the scheduling of a typical multi-purpose batch plant with a network structure. Multi-purpose process scheduling is more difficult to deal with compared to single-stage or multi-stage process scheduling. A large amount of literature on this problem has been published and nearly all of the authors used mathematical programming (MP) methods for solution. In the MP methods, a huge number of binary variables, as well as numerous constraints to consider mass balance and sequencing of batches in space/time dimensions, are needed for the large-size problem, which leads to very long computational time. In the proposed GA, only a small part of the binary variables are selected to code into binary chromosomes, which is realized through the identification of crucial products/tasks/units. Due to the logical heuristics utilized to decode a chromosome into a schedule, only the feasible solution space is searched. Our genetic algorithm has first been devised with particular crossover for makespan minimization and then adjusted for production maximization. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Process systems engineering
Scheduling
Multi-purpose batch plant
Genetic algorithm
Binary coding
Special crossover
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
2.3W
被引数:
5.5W
机构
引用论文
.png){kind=icon}
A two-stage methodology for short-term batch plant scheduling: discrete-event simulation and genetic algorithm短期批处理车间调度的两阶段方法: 离散事件模拟和遗传算法
PREAI
分享收藏
分享收藏
查看更多内容