Abstract: Under the context of deicing in the airport and in order to solve a kind of non-identical parallel multi-machine schedule problem for minimizing the number of passengers delayed, an ant colony algorithm is suggested. Considering the characteristic of scheduling model and its’ constraints, an improved pheromone update strategy is developed. The result is superior to that of traditional FIFO algorithm, indicates that the improved ant colony algorithm is valid and can fit for non-identical parallel multi-machine schedule problem.

Key words: non-identical parallel machine schedule, modern service, ant colony algorithm, schedule problem

摘要： 针对非等同并行机服务调度问题，以机场除冰调度服务为背景并以最小化旅客延误数为目标，提出了一种改进的蚁群算法。该算法根据调度模型的特点，充分考虑模型的约束条件并运用了一种改进的信息素更新策略求解并行机调度问题。仿真结果表明，改进的蚁群算法收敛速度快且结果较优，明显优于FIFO算法，适合求解非等同并行机调度问题。

关键词: 非等同并行机, 现代服务业, 蚁群算法, 服务调度