Heuristic algorithm for fixed job scheduling problem

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volumn 5, Issue , 2007, Pages 698-701

  Xu, Jie ^a   Sun, Hong ^b   Yang, Wei ^c  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b China Civil Aviation Flying College   (China)

^c XIHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AIRLINE AIRCRAFT DISPATCHING PROBLEMS; OPTIMAL DIRECTED PATH DECOMPOSITION PROBLEM; SEQUENTIAL NETWORK MODEL;

AIR TRAFFIC CONTROL; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

HEURISTIC ALGORITHMS;

EID: 38049003016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.414     Document Type: Conference Paper

References (5)

1. I. Gertsbakh and Stern, H. L. Minimal resources for fixed and variable job schedules. Opnl. Res. 1978 (26), pp. 68-85.
2. M. S. Fischetti, Martello, and P. Toth. The fixed job schedule problem with spread-time constraints. Operations Research, 1987, 35, (6), pp.849-858.
3. M. S. Fischetti, Martello and P. Toth. Approximation algorithms for fixed job schedule problems. Operations Research, 1992, 40, (1), pp.s96-s108.
4. S. Hong and Du W., Airline Fleet Dispatch Scheduling: Optimizing Model and Algorithm. University of Electronic Science and Technology of China publishing company. 2004, 5
5. S. Hong, Wen J. and Xu J.. Tail-Number-Assignment Problem of Airliners Based on Fleet Balance Application. Journal of Southwest Jiaotong University, 2004, 39, (5), pp.569-572