The Ground Routing Problem focuses on finding the optimal routing of aircraft from parking stands to runways. The Runway Sequencing Problem consists in ordering the sequence of takes-offs and landings on runways. We study the integration of these two problems with the aim of simultaneously increasing runway efficiency and reducing taxi times. We propose a heuristic sequential approach based on a novel mathematical formulation. We test our methods using real data of a major European airport. Our approach significantly reduces the total completion and taxi times within reasonable computation times, making it viable to be used in daily operations.