Short-term schedulability analysis of crude oil operations in refinery with oil residency time constraint using Petri nets

46Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A short-term schedule for oil refinery should arrange all the activities in every detail for the whole scheduling horizon, leading to a complex problem. There lacks efficient techniques and software tools for its solution applicable to industrial oil refinery. Considering that the feasibility of a schedule is essential, this paper studies the feasibility problem from a control perspective. A short-term schedule is composed of a series of operation decisions (ODs), each of which can be seen as a control. When an OD is executed, it transfers the system from one state to another. To guarantee the schedule feasibility, the system should be always be kept in safe states. The system is modeled by a Petri net model that is under control of the ODs. With this model, schedulability conditions for a system with one distiller are presented. These conditions reveal the relationship among the number of charging tanks, the oil transportation flow rate of the pipeline, and the production rate. The conditions are presented in a constructive way. Based on the conditions, when a realizable refining schedule is verified, a detailed short-term schedule is created for practical use. © 2008 IEEE.

Cite

CITATION STYLE

APA

Wu, N. Q., Chu, F., Chu, C., & Zhou, M. C. (2008). Short-term schedulability analysis of crude oil operations in refinery with oil residency time constraint using Petri nets. IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, 38(6), 765–778. https://doi.org/10.1109/TSMCC.2008.2001688

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free