Aircraft Landing Scheduling Optimization for Single Runway Noncontrolled Airports: Static Case

ai = time aircraft i lands after the preferred landing time Pi (i 1; . . . ; N) bi = time aircraft i lands before the preferred landing time Pi (i 1; . . . ; N) C = cost coefficient vector defined in the linear programming problem Ei = earliest landing time for aircraft i (i 1; . . . ; N) fi = penalty cost per unit of time if aircraft i lands before the preferred landing time Pi (i 1; . . . ; N) gi = penalty cost per unit of time if aircraft i lands after the preferred landing time Pi (i 1; . . . ; N) Li = latest landing time for aircraft i (i 1; . . . ; N) N = number of aircraft Pi = preferred landing time for aircraft i (i 1; . . . ; N) Sij = separation time requirement between aircraft i and j, where aircraft i lands before j (i 1; . . . ; N, j 1; . . . ; N, i ≠ j) xi = landing time for aircraft i X = decision variable vector defined in the linear programming problem Z = objective function defined in the linear programming problem ij = 1 if aircraft i lands before aircraft j and 0 otherwise (i 1; . . . ; N, j 1; . . . ; N, i ≠ j)