The sequencing problem is modeled as a cumulative traveling salesman problem (TSP) with ready time, static and dynamic, two cases, are considered, and a set of constraints are adde.

• 提出了一种新的终端区规划排序模型,把飞机的排序问题看作等价于带有准备好时间的渐增周游店员问题,并给出了兼顾解的最优性和计算复杂性的快速启发式算法。