Reference Hub2
Modeling and Scheduling of Crude Oil Operations in Refinery: A Hybrid Timed Petri Net Approach

Modeling and Scheduling of Crude Oil Operations in Refinery: A Hybrid Timed Petri Net Approach

NaiQi Wu, Mengchu Zhou, Feng Chu, Said Mammar
ISBN13: 9781466639225|ISBN10: 1466639229|EISBN13: 9781466639232
DOI: 10.4018/978-1-4666-3922-5.ch001
Cite Chapter Cite Chapter

MLA

Wu, NaiQi, et al. "Modeling and Scheduling of Crude Oil Operations in Refinery: A Hybrid Timed Petri Net Approach." Embedded Computing Systems: Applications, Optimization, and Advanced Design, edited by Mohamed Khalgui, et al., IGI Global, 2013, pp. 1-49. https://doi.org/10.4018/978-1-4666-3922-5.ch001

APA

Wu, N., Zhou, M., Chu, F., & Mammar, S. (2013). Modeling and Scheduling of Crude Oil Operations in Refinery: A Hybrid Timed Petri Net Approach. In M. Khalgui, O. Mosbahi, & A. Valentini (Eds.), Embedded Computing Systems: Applications, Optimization, and Advanced Design (pp. 1-49). IGI Global. https://doi.org/10.4018/978-1-4666-3922-5.ch001

Chicago

Wu, NaiQi, et al. "Modeling and Scheduling of Crude Oil Operations in Refinery: A Hybrid Timed Petri Net Approach." In Embedded Computing Systems: Applications, Optimization, and Advanced Design, edited by Mohamed Khalgui, Olfa Mosbahi, and Antonio Valentini, 1-49. Hershey, PA: IGI Global, 2013. https://doi.org/10.4018/978-1-4666-3922-5.ch001

Export Reference

Mendeley
Favorite

Abstract

The process of an oil refinery contains both discrete event and continuous variables and can be characterized as a hybrid system. It is extremely challenging to schedule such a system. The short-term scheduling problem of crude oil operations addressed in this chapter is one of the most difficult parts. With jobs to be scheduled being unknown at the beginning, heuristics and meta-heuristics are unable to be applied. Thus, by the existing methods, this problem is formulated as a mathematical programming problem and solved by using exact methods. However, because it is NP-hard in nature, mathematical programming is not computationally efficient and cannot be applied in practice. Up to now, there is no software designed to this problem. In this chapter, for the first time, the problem is studied in a control theory perspective. The problem is modeled by a type of hybrid Petri nets. Based on the model, a two-level control architecture is presented. At the lower level, it solves the schedulability and detailed scheduling problem in a hybrid control theory perspective. At the upper level, it solves a refining scheduling problem, a relative simple problem, with the schedulability conditions as constraints. Consequently, it results in a breakthrough solution such that the large practical application problem can be solved.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.