New Continuous-Time Formulation and Algorithm for Crude-Oil Scheduling Problems with Oil Residency Time Constraint and Pipeline Transportation


== 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:

* [http://dx.doi.org/10.14257/astl.2016.121.09 http://dx.doi.org/10.14257/astl.2016.121.09]

* [http://pdfs.semanticscholar.org/9579/1731e58c07cde3aff3d557213d2d096d11bd.pdf http://pdfs.semanticscholar.org/9579/1731e58c07cde3aff3d557213d2d096d11bd.pdf]

* [http://onlinepresent.org/proceedings/vol121_2016/9.pdf http://onlinepresent.org/proceedings/vol121_2016/9.pdf],
: [https://academic.microsoft.com/#/detail/2323863865 https://academic.microsoft.com/#/detail/2323863865]