Skoči na glavni sadržaj

Izvorni znanstveni članak

Nonlinear Blend Scheduling via Inventory Pinch-based Algorithm using Discrete- and Continuous-time Models

V. Mahalec ; Dept. of Chemical Engineering, McMaster University, Hamilton, ON L8S 4L8, Canada
P. Castillo Castillo ; Dept. of Chemical Engineering, McMaster University, Hamilton, ON L8S 4L8, Canada

Puni tekst: engleski pdf 888 Kb

str. 425-436

preuzimanja: 596



This work uses multi-period, inventory pinch-based algorithm with continuous-time model (MPIP-C algorithm1) for scheduling linear or nonlinear blending processes. MPIP-C decomposes the scheduling problem into (i) approximate scheduling and (ii) detailed scheduling. Approximate scheduling model is further decomposed into two parts: a 1st level model which optimizes nonlinear blend models (with time periods delineated by inventory pinch points), and a 2nd level multi-period mixed-integer linear programming model (which uses fixed blend recipes from the 1st level solution) to determine optimal production plan and swing storage allocation, while minimizing the number of blend instances and product changeovers in the swing tanks. The 3rd level computes schedules using a continuous-time model including constraints based on the short-term plan solution. Nonlinear constraints are used for the Reid vapor pressure in our case studies. Excellent computational performance is illustrated by comparisons with previous approach with discrete-time scheduling model.

Ključne riječi

inventory pinch, nonlinear gasoline blending, discrete-time scheduling model, continuous-time scheduling model

Hrčak ID:



Posjeta: 1.271 *