摘要
This article addresses a production planning optimization problem of overall refinery. The authors formulated the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to the use of run-modes of processing units. The aim of this planning is to decide which run-mode to use in each processing unit in each period of a given horizon, to satisfy the demand, such as the total cost of production and inventory is minimized. The resulting model can be regarded 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. The authors have proposed a column generation-based algorithm called branch-and-price （BP） for solving the interested optimization problem. The model and implementation of the algorithm are described in detail in this article. The computational results verify the effectiveness of the proposed model and the solution method.
这篇文章探讨计划全面精炼厂的优化问题的生产。作者提出了混合了整数的优化问题线性编程。模型为优化与加工设备的跑模式的使用有关的全面精炼厂的生产计划考虑主要因素。这个计划的目的是决定哪个在一根给定的地平线的每个时期在每台工艺设备使用的跑模式，满足需求，例如总数，生产和库存的费用被最小化。产生模型能被认为是一个跑模式能生产并且消费超过一个产品的一个概括缩放许多的问题。产生优化问题大尺寸、 NP 难。作者建议了基于产生的算法为解决感兴趣的优化问题把 branch-and-price (BP ) 称为的列。算法的模型和实现在这篇文章详细被描述。计算结果验证建议模型和答案方法的有效性。
基金
Supported by the National Natural Science Foundation for Distinguished Young Scholars of China （No.70425003）, the National High Technology Research and Development Program of China （No.2006AA04Z174）, the Natural Science Foundation of Liaoning Province （No.20061006） and the Enterprise Post-Doctorial Foundation of Liaoning Province.
