The present work focuses on the Elective Surgeries Scheduling Problem. This problem consists to allocate a set of elective surgeries along the scheduling program considering the available hospital resources, namely: operating rooms, medical equipment, surgeons, nurses, anesthetists, cleaning teams, among others. The purpose is to present the elective surgeries scheduling with the lowest possible processing time. Due the hospital resources are, in most cases, scarce as well as expensive, sharing them and allocating surgeries in a systemic way are necessary, since solving this problem is possible to reduce the total execution time, increase the number of scheduled surgeries and reduce the waiting time for patients. To solve this complex combinatorial problem, characterized as NP-hard, it is proposed the computational heuristic algorithm called ESSILS (Elective Surgery Scheduling Iterated Local Search), which combines the metaheuristics Iterated Local Search, Variable Neighborhood Descent and Tabu Search. Published studies have shown that the use of computational techniques for this kind of problem is rarely addressed in Brazil. In view of this, this work also intends to contribute with decision makers during the elective surgeries scheduling activities in many hospitals of the country. This proposal was tested in benchmark problems of literature and also real problems of a large hospital in São Paulo (Brazil), being effective in relation to other existing approaches.