Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem
Algorithm 1
Step 1. Sequence all the flights in decreasing order of their aircraft size and then in nondecreasing order of their arrival time.
Step 2. Assign each flight in turn to a gate which is not occupied by another flight; if there is no available gate, assign the flight to the remote apron stand.
Step 3. Count the number of flights already assigned to each gate, and set the maximum number among the gates to be the number of time slots for each gate in the model.