Refinery Short-Term Scheduling Using Continuous Time Formulation: Crude-Oil Operations
Citations Over TimeTop 10% of 2003 papers
Abstract
This paper addresses the problem of crude-oil short-term scheduling, which is the first part of the overall refining operations. The problem involves the optimal operation of crude-oil unloading from vessels, its transfer to storage tanks, and the charging schedule for each crude-oil mixture to the distillation units. A novel model is developed based on a continuous-time representation and results in a mixed-integer linear programming (MILP) problem. The state-task network representation is used throughout this paper. The proposed formulation is applied to several case studies and leads to fewer binary and continuous variables and fewer constraints compared with existing discrete-time models. Thus, an efficient solution can be achieved using available MILP solvers.
Related Papers
- → Allocation of energy use in petroleum refineries to petroleum products(2004)232 cited
- → Adaptive CO2 emissions mitigation strategies of global oil refineries in all age groups(2021)64 cited
- → USE OF GENETIC ALGORITHMS IN CREATING OIL BLENDS REQUIRED FOR REFINERY DISTILLATION PLAN(2022)2 cited
- → The Determinants of Plant Exit: the Evolution of the U.S. Refining Industry(2018)1 cited
- In the present stage, most large refineries in the USSR are generally using as feedstock a mixture of several crudes that differ substantially from each other in physical and chemical properties, these crudes coming into the mix in unregulated, arbitrarily varying proportions.(1973)