The Aircraft Maintenance Routing Problem (AMRP) constructs a route for each aircraft in a fleet that satisfies maintenance requirements while covering a set of flight legs. The operational variant of AMRP manages maintenance on an individual basis, taking into account each aircraft's route, scheduled flights, and specific flying indicators. In this work, we address the Operational Aircraft Maintenance Routing Problem (OAMRP) over a seven-day horizon, focusing on type A maintenance checks, which involve visual inspections of all major aircraft systems. This type of maintenance is the most frequent in the short-term planning because it can be seamlessly integrated into the routing of aircraft. The aircraft flying indicators considered in OAMRP are the flying time, flight cycles or takeoffs, and flying days. The objective is to minimize the remaining value of each flying indicator before maintenance. This work extends the mixed-integer linear program from the literature by incorporating hangar capacity constraints that vary across maintenance stations and depend on the day. This extension improves the realism of the model by capturing a key operational limitation frequently encountered by airlines (limited maintenance hangars). We conduct an extensive set of computational experiments on real and recent instances from an airline company. These experiments not only assess the computational performance of the extended model but also provide a deep understanding of its behaviour when each flying indicator (hours, takeoffs, and days) is minimized.