Short-term schedulability analysis of multiple distiller crude oil operations in refinery with oil residency time constraint

Document Type

Article

Publication Date

1-1-2009

Abstract

Because of the complexity of a short-term scheduling problem for crude oil operations, some constraints are ignored in modeling the system by the existing approaches, leading to an infeasible solution. To avoid this, the short-term scheduling problem can be studied in control theory perspective by viewing an operation decision in the schedule as a control. With this idea, this paper conducts the schedulability analysis for systems with two and more than two distillers, and the schedulability conditions are presented with the help of Petri net theory. It shows that the number of charging tanks and their capacity, the amount of crude oil of different types in the charging tanks, the oil transportation rate of the pipeline, and the production rate of the system affect the safeness of the system. It also presents the conditions under which the system can reach its maximal production rate. With the safeness conditions and proved results presented in this paper, if a refining schedule is realizable, a feasible detailed schedule for the refining schedule can be easily obtained by creating the operation decisions for the schedule one by one. In the schedule obtained, the starting time of each operation decision can be at any continuous time point, and the schedule is certainly feasible, which overcomes the difficulty faced by techniques that are based on mathematical programming methods. © 2008 IEEE.

Identifier

58649115610 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part C Applications and Reviews

External Full Text Location

https://doi.org/10.1109/TSMCC.2008.2001709

ISSN

10946977

First Page

1

Last Page

16

Issue

1

Volume

39

Grant

6104659

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS