.png){kind=icon}
返回
Efficient Decomposition Approach for Large-Scale Refinery Scheduling
.png){kind=icon}
PRE
AI
DOI：10.1021/ie504835b.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a heuristic algorithm for integrated scheduling of refinery production unit operations and finished product blending and delivery operations. To apply the proposed iterative algorithm, the integrated oil-refinery scheduling problem is decomposed into a production unit scheduling problem and a finished product blending and delivery scheduling problem. The goal of the algorithm is to obtain a feasible solution that satisfies product demand commitments with minimum demurrage violations while minimizing run-mode changeover cost, inventory cost, and penalties subject to product and logistics giveaways. The proposed algorithm provides a feasible solution at the end of each iteration, and to obtain solution without demurrage violations, a set of integer cuts are generated at the end of an iteration to eliminate current task assignment sequence for a multipurpose blend unit. The applicability of the algorithm is illustrated by a realistic large-scale refinery case study producing diesel and jet fuel. Significant savings are realized in the computational effort.
Keyword:
CONTINUOUS-TIME FORMULATION
MULTIMILLION-DOLLAR BENEFITS
LINEAR-PROGRAMMING MODEL
CRUDE-OIL BLENDSHOP
MIXED-INTEGER
RECIPE DETERMINATION
BLENDING OPERATIONS
OPTIMIZATION
ABILITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容