Modelling robust flight-gate scheduling as a clique partitioning problem

Transportation Science

Volumn 42, Issue 3, 2008, Pages 292-301

  Dorndorf, Ulrich ^a   Jaehn, Florian ^b   Pesch, Erwin ^b  

^a Inform GmbH   (Germany)

^b UNIVERSITY OF SIEGEN   (Germany)

Author keywords

Airport gate scheduling; Clique partitioning; Ejection chain; Robustness

Indexed keywords

AIR TRAFFIC CONTROL; CHAINS; CLUSTERING ALGORITHMS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

CLIQUE PARTITIONING; EFFECTIVE APPROACHES; EJECTION CHAIN; FLIGHT DELAYS; GATE SCHEDULING; GRAPH PROBLEMS;

PROBLEM SOLVING;

EID: 70449635860     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1070.0211     Document Type: Article

References (13)

1. Bolat, A. 2000. Procedures for providing robust gate assignments for arriving aircraft. Eur. J. Oper. Res. 120 63-80.
2. Ding, H., A. Lim, B. Rodrigues, Y. Zhu. 2004. New heuristics for the overconstrained airport gate assignment problem. J. Oper. Res. Soc. 55 760-768.
3. Dorndorf, U. 2002. Project Scheduling with Time Windows: From Theory to Applications. Physica, New York.
4. Dorndorf, U., E. Pesch. 1994. Fast clustering algorithms. ORSA J. Comput. 6 141-153.
5. Dorndorf, U., A. Drexl, Y. Nikulin, E. Pesch. 2007. Flight gate scheduling: State-of-the-art and recent developments. Omega 35 326-334.
6. Dyer, M. E., A. M. Frieze. 1985. On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10 139-153.
7. Glover, F. 1996. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65 223-253.
8. Glover, F., E. Pesch. 1997. TSP ejection chains. Discrete Appl. Math. 76 165-181.
9. Grötschel, M., Y. Wakabayashi. 1989. A cutting plane algorithm for a clustering problem. Math. Programming B 45 52-96.
10. Grötschel, M., Y. Wakabayashi. 1990. Facets of the clique partitioning polytope. Math. Programming A 47 367-387.
11. Hassounah, M. I., G. N. Steuart. 1993. Demand for aircraft gates. Transportation Res. Record 1423 26-33.
12. Kernighan, B. W., S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell System Tech. J. 49 291-307.
13. Nikulin, Y. 2006. Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography. 1Working Paper 583, University of Kiel, Kiel, Germany.