Heuristics to Solve Multiple Objective NP-Hard Aircraft Gate Scheduling Problem

This project uses Pm|pj, rj, dj| ΣTj approach to minimize tardiness at gates for a set of flights whose ready time (release time), occupation time (processing time) and due date are known.

This problem is known as an NP-hard problem and hence heuristic approaches are involved to reach a close to optimal solution.

Among multiple solutions for the first objective, ties are broken based on the minimum value of total walking distances. That is the best solution gives maximum number of passengers to be in the gate which is closer to the exit.