Abstract
With a combinatorial nature and hybrid characteristics, it is very challenging to schedule crude oil operations in a refinery and, up to now, there is no software tool for practical use in this field. To solve this problem, based on the two-level architecture in our previous work, for cases where crude oil mixing is required, this paper investigates the refining scheduling problem at the upper level. Based on the schedulability conditions, a three-stage approach is proposed. First, a linear programming model is developed to maximize productivity. Second, another linear programming model is built and solved to optimally obtain the mixed crude oil types and their amounts, and assign them into the distillers. Finally, this paper simply sequences and merges the oil parcels obtained at the second stage to form a desired schedule. Because the proposed approach mainly solves two linear programming problems, it is very efficient. An industrial case study is presented to illustrate the proposed approach.
Author supplied keywords
Cite
CITATION STYLE
Wu, N. Q., Bai, L. P., & Zhou, M. C. (2016). An Efficient Scheduling Method for Crude Oil Operations in Refinery with Crude Oil Type Mixing Requirements. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 46(3), 413–426. https://doi.org/10.1109/TSMC.2014.2332138
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.