(Created page with " == Abstract == The optimal scheduling of crude-oil operation in refineries has been studied by various groups during the past decade, leading to different mixed integer line...") |
m (Scipediacontent moved page Draft Content 319787951 to Chen Zhao 2016a) |
(No difference)
| |
Latest revision as of 23:05, 28 January 2021
Abstract
The optimal scheduling of crude-oil operation in refineries has been studied by various groups during the past decade, leading to different mixed integer linear programming or mixed nonlinear programming formulations. This paper proposes a new MINLP formulation with an oil residency time constraint and common pipeline transportation that is based on single-operation sequencing (SOS). An effective choice strategy for priority-slot number is presented. This model is also developed upon the representation of a crude-oil scheduling by a single sequence of transportation operations. A method is proposed to solve this model which can get optimal solution with the smallest priority-slot number if it exists.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2016
Volume 2016, 2016
DOI: 10.14257/astl.2016.121.09
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?