Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/13622
Title: Crude oil scheduling in refinery operations
Authors: PRODDUTURI CHANDRA PRAKASH REDDY
Keywords: scheduling, crude oil, petroleum refinery, Single Buoy Mooring (SBM), multiple jetties, MILP, MINLP
Issue Date: 6-Mar-2004
Citation: PRODDUTURI CHANDRA PRAKASH REDDY (2004-03-06). Crude oil scheduling in refinery operations. ScholarBank@NUS Repository.
Abstract: Scheduling is one of the tools that facilitates refiner to be proactive for changing scenarios and allows finding solutions that generate enhanced income. Scheduling considerations prevalent with crude oil operations in a petroleum refinery have been addressed in this work. Scheduling of crude oil operations is part of optimization of overall refinery operations and involves unloading crude oil from vessels to storage tanks and charging various mixes of crude oils from tanks to each distillation unit subject to capacity, flow, and composition limitations. Refinery configurations with different unloading facilities such as SBM (Single Buoy Mooring), multiple jetties are considered in this study. Scheduling of crude oil operations is a complex nonlinear problem, especially when tanks hold crude mixes. A novel iterative MILP solution approach for optimizing crude oil operations is devised which obviates the need for solving MINLP. This work addresses both discrete and continuous time scheduling models for crude oil scheduling problem and presents a head to head comparison of the two models. The proposed methodology performs much better in comparison to methodologies present in the literature and gives near optimum solutions, thus making them suitable for large-scale operations.
URI: http://scholarbank.nus.edu.sg/handle/10635/13622
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_HT016807A.pdf2.89 MBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.