TY - JOUR
T1 - Short-term schedulability analysis of crude oil operations in refinery with oil residency time constraint using Petri nets
AU - Wu, Nai Qi
AU - Chu, Feng
AU - Chu, Chengbin
AU - Zhou, Meng Chu
N1 - Funding Information:
Manuscript received July 6, 2007; revised February 22, 2008. Current version published October 20, 2008. This work was supported in part by the National Natural Science Foundation of China under Grant 60474061, by the Natural Science Foundation of Guangdong Province under Grant 6104659, by the Technology R&D Program of Guangdong Province under Grant 2005B50101013, the Chang Jiang Scholars Program, Ministry of Education, P.R. China, and by le Conseil Regional de la Champagne-Ardenne, France. This paper was recommended by Associate Editor J. Wang.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - Automated manufacturing system
KW - Hybrid Petri net
KW - Oil refinery
KW - Petri net (PN)
KW - Scheduling
KW - Short-term scheduling
UR - http://www.scopus.com/inward/record.url?scp=56049106348&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56049106348&partnerID=8YFLogxK
U2 - 10.1109/TSMCC.2008.2001688
DO - 10.1109/TSMCC.2008.2001688
M3 - Article
AN - SCOPUS:56049106348
SN - 1094-6977
VL - 38
SP - 765
EP - 778
JO - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
JF - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
IS - 6
ER -