The main aim of this thesis is to create an exact mathematical tool that allows to solve the problem of vessels scheduling to o shore platforms with multiple time windows.The tool has been tested with several instances and some extended experiments have been carried out with the use of real data. The problem can be summarized as a number of platforms that need to be supplied frequently via sea from a single base. What we want to obtain is an assignation of vessels and times to visit those platforms. At the same time, it is needed to verify a number of constraints such as: opening times, maximum duration of the voyages or frequency of the visits. The solution model consists of 2 parts. In the rst part we have to generate a number of possible voyages and in the second part we have to choose some of those voyages and assign them to vessels and times under some restrictions and preferences. It has been validated with two data sets: one small and one medium. The experiments and the results has been done with a large data set. The tool has been proved functional, although not fast. To reduce the number of voyages and accelerate the process a procedure has been applied and suggested. Furthermore, some experiments on the data has been undergone and one of the conclusions is that the slacks at the end of the voyages are less costly than to distribute them along the voyages.