Maximizing the utilization of maintenance hangar is crucial for independent aircraft maintenance companies in order to meet the increasing maintenance demands from airline companies and survive in the intense competition within the industry. Hangar space is one of the resource constraints in aircraft maintenance scheduling problem. In this study, No-Fit Polygons (NFP) construction is adopted to prevent overlap between aircraft. Two Mixed-Integer Linear Programming (MILP) formulations are proposed with the objective to maximize the utilization of hangar while minimizing the risk of collision between aircraft. The proposed models are solved by the default branch-and-bound algorithm provided by CPLEX. Eight testing instances are generated based on the real-life data from an aircraft maintenance company. The computational results show that the default branch-and-bound algorithm is able to provide feasible parking layouts for all instances.