Abstract Among the refined petroleum products obtained in an oil refinery, gasoline contributes with more than half of the total profits. This work is focused on the last stage of the gasoline processing in which different "cuts" are blended together with additives and oil fractions in order to fulfill customers' demands with the right product at the right time. The short-term planning of these operations becomes a complex task due to the need of managing a large number of orders, delivery time-windows, blending equipments, intermediate and final product tanks, quality specifications, and variable product recipes. Early works have adopted mixed-integer linear programming (MILP) models, based on unit-specific time slots, requiring extremely large CPU times to obtain the optimal solution. This work introduces an alternative formulation using the General Precedence sequencing concept for the integrated short-term planning of gasoline blending and distribution operations in order to minimize production costs, inventory levels and quality giveaways; improve customer satisfaction and avoid ship demurrage. Six industry-scale examples have been solved. Compared to previous works, results show similar solutions with reductions in CPU times of up to three orders of magnitude.
[1]
Jie Li,et al.
Recipe determination and scheduling of gasoline blending operations
,
2009
.
[2]
Pablo A. Marchetti,et al.
Mixed-Integer Linear Programming Monolithic Formulations for Lot-Sizing and Scheduling of Single-Stage Batch Facilities
,
2010
.
[3]
Jaime Cerdá,et al.
State-of-the-art review of optimization methods for short-term scheduling of batch processes
,
2006,
Comput. Chem. Eng..
[4]
I. Karimi,et al.
Improving the robustness and efficiency of crude scheduling algorithms
,
2007
.
[5]
I. Karimi,et al.
Scheduling Gasoline Blending Operations from Recipe Determination to Shipping Using Unit Slots
,
2011
.