In this work we present an outer-approximation algorithm to obtain the global optimum of a nonconvex mixed-integer nonlinear programming (MINLP) model that is used to represent the scheduling! of crude oil movement at the front-end of a petroleum refinery. The model relies oil a continuous time representation making use of transfer events. The proposed algorithm focuses oil effectively solving a mixed-integer linear programming (MILP) relaxation of the nonconvex MINLP to obtain a rigorous lower hound (LB) oil the global optimum. Cutting planes derived by spatially decomposing the network are added to the MILP relaxation of the original nonconvex MINLP in order to reduce the solution time for the MILP relaxation. The solution of this relaxation is used as a heuristic to obtain a feasible Solution to the MINLP which serves as an upper bound (UB). The lower and upper bounds are made to converge to within a specified tolerance in the proposed outer-approximation algorithm. On applying the proposed technique to test examples, significant savings are realized in the computational effort required to obtain provably global optimal solutions. (c) 2008 Elsevier Ltd. All rights reserved.