【摘要】 通过分析飞机运行的时区集合特点,将飞机调度问题转化为固定工件排序问题。根据工件占用机器的时间区间,利用划分时间片算法把需要平行作业的工件挑选出来组成无向图的相邻顶点,从而将固定工件问题转化为图的k-顶点着色问题,然后建立0-1整数规划数学模型,并设计出相应的模拟退火算法。最后应用该算法针对飞机调度问题进行了仿真研究,结果表明:在可接受的时间内能够得到该问题的满意解。更多还原

【Abstract】 In order to solve airline aircraft dispatching problem which is NPC problem,time intervals which aircraft processes are analyzed.According to the method of making out time intervals,jobs,which are being done at the same time,are chosen to compose various sets whose elements cannot be processed by same machine.And the elements are considered as adjoining vertexes,the fixed job scheduling problem is transformed to a k-vertex coloring problem.Then,a 0-1 integer programming mathematical model is built and the simulated annealing algorithm is applied to solve the model.At last,the instance illuminates the model and algorithm are to be feasible.更多还原