LINEAR PROGRAMMING-BASED METHOD FOR REFINING SCHEDULING OF CRUDE OIL OPERATIONS IN REFINERY WITH CRUDE OIL TYPE MIXING REQUIREMENTS

摘要

#$%^&*AU2014100481A420140626.pdf#####Abstract: With 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 work studies the refining scheduling problem at the upper level. Based on the schedulability conditions, a three-stage approach is proposed. At Stage 1, a linear programming model is developed to maximize the productivity. At Stage 2, another linear programming model is built and solved to optimally obtain the mixed crude oil types and their amount, and assign them into the distillers. At Stage 3, it simply sequences and merges the oil parcels obtained at Stage 2 to form a desired schedule. Because it mainly solves two linear programming problems, it is very efficient. An industrial case study is presented to show the application of the proposed approach. Abstract figure: FIG. 3 Docket No.: UM1140AUOO 34tge 1 Linear programming for productivity maximization Linear programming for determining the MInitial and -Stage 2 types of oil and their amount to be used, and state assigning them into the distillers to maximize information the processing effectiveness Sequencing and merging the parcels of crude tage 3 oil for distiller feeding to minimize changeover cost FIG. 3 DS, 38500 (#6) DS2 12000 (#3) 20369.6 (#5) 14502.4 (#7) DS, 7200 (#2) 32000 (#4) 11872 (#2) Time (h) I I I I I | I I I I I I I I I 0 20 40 60 80 100 120 140 160 FIG. 4 Docket No.: UM1140AUOO 36