Short-term crude-oil scheduling model and algorithm with charging tank switch overlap constraint and pipeline transportation

Various groups have studied the optimal crude-oil operation scheduling problem in refineries over the last few decades, resulting in diverse mixed integer linear programming or mixed nonlinear programming formulations. This paper proposes a novel mixed integer linear programming (MILP) formulation with charging tank switch overlap that is based on multi-operation sequencing with synchronized start time (MOS-SST). It is clearly distinct from antecedent formulations because it takes oil residency time constraint and charging tank switch overlap into account. Based on the characteristic of the formulation, this paper proves a theorem. A new algorithm using MILP solver proposed in this paper is applied to solving this model on the basis of the theorem, leading to a satisfactory optimal result.