In this paper we propose to study an extension of the classical RCPSP called the Multi-site RCPSP. This extension allows to take into account transportation times (both for resources and tasks) between several sites and has some medical or industrial applications for instance. We design an approximate resolution method in which three solution encodings are proposed. Each of them is coupled with a dedicated list algorithm which build feasible schedules. The results obtained on a benchmark inspired by literature are presented and discussed. The methods are also compared with a mathematical model.