An optimization model and algorithm for the production planning ofoverall refinery

摘要

This paper addressed a production planning optimization problem of overall refinery. We formulatethe optimization problem as mixed integer linear programming. The model considers the main factors foroptimizing the production plan of overall refinery related to use of run-modes of processing units. The aim of theplanning is to decide which run-mode to use in each processing unit in each period of a given horizon in order tosatisfy the demand while minimizing the total cost of production and Inventory. The resulting model can beregarded as a generalized lot-sizing problem where a run-mode can produce and consume more than one product.The resulting optimization problem is large-sized and NP-hard. We propose a column generation-basedalgorithm called branch-and-price (BP) for solving the interested optimization problem. The model andimplementation of the algorithm are described in detail in this paper. The computational results verify theeffectiveness of the proposed model and solution method.