.png){kind=icon}
返回
A hybrid MILP/CLP algorithm for multipurpose batch process scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2005.02.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel hybrid constraint logic programming (CLP) and MILP algorithm for scheduling complex multipurpose batch processes. The scheduling problem is decomposed into two sub-problems: first an aggregate planning problem is solved using an MILP model, and then a sequencing problem is solved using CLP techniques. The CLP model avoids the complexity of explicitly stating complete material balance constraints by instead using precedence constraints between batches to ensure the schedule is feasible. The efficiency of the algorithm is demonstrated with four examples and areas for future improvement are identified. (c) 2005 Published by Elsevier Ltd.
Keyword:
MlLP/CLP algorithm
constraint logic programming
process scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
A novel continuous-time MILP formulation for multipurpose batch plants. 1. Short-term scheduling
PREAI
分享收藏分享收藏
查看更多内容