Researches on Optimal Scheduling Model for Aircraft Landing Problem
暂无分享,去创建一个
In order to solve the aircraft landing optimal scheduling problem, a scheduling model based on single machine scheduling is proposed. Considering the influence on scheduling, multifactor decision-making is used to solve weight of the scheduling model. In order to work out the model, a scheduling algorithm based on greedy heuristic algorithm is proposed. Lastly, the algorithm is tested on some simulation cases. The results show that the algorithm has preferable scheduling performance and can solve the aircraft landing problem.
[1] Lucio Bianco,et al. Minimizing total completion time subject to release dates and sequence‐dependentprocessing times , 1999, Ann. Oper. Res..
[2] Zheng Hua-li. Artillery Battlefield Target Value Analysis Based on the Entropy , 2004 .
[3] Hong Mei. A Method of Grouped Arrival Aircrafts Scheduling Based on Single Machine Scheduling Problem , 2004 .