I'm trying to solve this MILP with binary constraints and I'm having difficulty.

0 Aircrafts Desired departure TS Time to land M (only 3 are landing) (T) Delay depart cost (CC) Advance Depart cost (C) Shorten travel time (M) cost (Cf) Lengthen travel time cost (M) (C) 2 2 2 2 2 2 .5 .5 0 0 0 0 0 0 .5 .5 Create MILP (Mixed Integer Linear Program using indicator constraints) that schedules T and Ti' by either advancing or delaying departure (C) (C) OR adjusting travel time (C") (C). Ti-required separation time between two aircraft Aircraft Number 1 2 3 4 5 6 NaN 7 5 8 26 NaN 9 10 5 9 38 6 NaN 9 10 7 49 89 NaN 8 9 | 5 7 5 8 7 NaN7 6 10 10 5 5 5 NaN Constraints Only one aircraft can land or depart at a time Total operation time must take