首页> 外文期刊>Automation Science and Engineering, IEEE Transactions on >Schedulability Analysis of Short-Term Scheduling for Crude Oil Operations in Refinery With Oil Residency Time and Charging-Tank-Switch-Overlap Constraints
【24h】

Schedulability Analysis of Short-Term Scheduling for Crude Oil Operations in Refinery With Oil Residency Time and Charging-Tank-Switch-Overlap Constraints

机译:驻留时间和装料槽切换重叠约束的炼油厂原油短期调度的可调度性分析

获取原文
获取原文并翻译 | 示例

摘要

For short-term scheduling of crude oil operations in refinery, often crude oil residency time constraint and charging-tank-switch-overlap constraint are ignored by mathematical programming models to make the problem solvable. Thus, a schedule obtained by such mathematical programming models is infeasible and cannot be deployed. To solve this problem, this work studies the short-term scheduling problem of crude oil operations in a control theory perspective. The system is modeled by a hybrid Petri net and a short-term schedule is seen as a series of control commands. With this model, schedulability analysis is carried out and schedulability conditions are presented. These conditions can be used as constraints for finding a realizable and optimal refining schedule. Moreover, based on the proposed approach, a detailed schedule can be easily obtained given a realizable refining schedule. In this way, the complexity for the short-term scheduling problem of crude oil operations in refinery is greatly reduced and effective techniques and tools for practical applications can be obtained.
机译:对于炼油厂原油作业的短期调度,数学编程模型通常会忽略原油驻留时间约束和装料-油箱切换重叠约束,以解决问题。因此,通过这样的数学编程模型获得的时间表是不可行的并且不能被部署。为了解决这个问题,这项工作从控制理论的角度研究了原油作业的短期调度问题。该系统由混合Petri网建模,短期计划被视为一系列控制命令。利用该模型进行了可调度性分析,并给出了可调度性条件。这些条件可用作寻找可实现的最佳炼油计划的约束。而且,基于所提出的方法,给定可实现的提炼进度表,可以轻松获得详细的进度表。这样,极大地降低了炼油厂原油作业的短期调度问题的复杂性,可以获得有效的实用技术和工具。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号