Runway sequencing with holding patterns

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 1254-1266

  Artiouchine, Konstantin ^a,b   Baptiste, Philippe ^b   Dürr, Christoph ^b  

^a Thales Research K Technology Domaine de Corbeville   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Air traffic control; Mixed integer programming; Scheduling

Indexed keywords

AIR TRAFFIC CONTROL; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

DISJOINT TIME WINDOWS; MIXED INTEGER PROGRAMMING; POLYNOMIAL TIME;

OPERATIONS RESEARCH;

EID: 40949118042     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.06.076     Document Type: Article

References (19)

1. Arkin E.M., and Silverberg E.B. Scheduling with fixed start and end times. Discrete Applied Mathematics 18 (1987) 1-8
2. Baptiste Ph., Le Pape C., and Nuijten W. Constraint-based Scheduling (2001), Kluwer Academic Publishers
3. Baptiste Ph. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling 2 (1999) 245-252
4. N. Barnier, P. Brisset, Slot allocation in air traffic flow management, in: Proceedings of the the Second International Conference and Exhibition on The Practical Application of Constraint Technology and Logic Programming, 2000 Manchester, United Kingdom.
5. A.M. Bayen, C.J. Tomlin, Real-time discrete control law synthesis for hybrid systems using MILP: Application to congested airspace, in: Proceedings of the American Control Conference, 2003.
6. A.M. Bayen, C.J. Tomlin, Y. Ye, J. Zhang, An approximation algorithm for scheduling aircraft with holding time, in: Proceedings of the 43rd IEEE Conference on Decision and Control.
7. A.M. Bayen, C.J. Tomlin, Y. Ye, J. Zhang, MILP formulation and polynomial time algorithm for an aircraft scheduling problem, cherokee.stanford.edu/~bayen/publications.html.
8. J. Carlier, Problèmes d'Ordonnancement à Contraintes de Ressources: Algorithmes et Complexité, Thèse de Doctorat d'Etat, Université Paris VI, 1984.
9. Crama Y., and Spieksma F.C.R. Scheduling jobs of equal length: Complexity, facets and computational results. Mathematical Programming 72 (1996) 207-227
10. Erlebach T., and Spieksma F.C.R. Interval selection: Applications, algorithms, and lower bounds. Journal of Algorithms 46 (2003) 27-53
11. Fischetti M., Martello S., and Toth P. Approximation algorithms for fixed job schedule problems. Operations Research 40 (1992) S96-S108
12. Garey M.R., Johnson D.S., Simons B.B., and Tarjan R.E. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing 10 2 (1981) 256-269
13. J. Hooker, A hybrid method for planning and scheduling, in: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Toronto, Canada, 2004.
14. Keil J.M. On the complexity of scheduling tasks with discrete starting times. Operation Research Letters 12 (1992) 293-295
15. Kroon L.G., Salomon M., and van Wassenhove L. Exact and approximation algorithms for the operational fixed interval scheduling problem. European Journal of Operational Research 82 (1995) 190-205
16. R. Sadykov, L. Wolsey, Integer programming and constraint programming in solving a multi-machine assignment scheduling problem with deadlines and release dates, Discussion paper 2003/81, Center for operations research and econometrics, Catholic University of Louvain, 2003.
17. Spieksma F.C.R. On the approximability of an interval scheduling problem. Journal of Scheduling (1999) 215-227
18. F.C.R. Spieksma, Y. Crama, The complexity of scheduling short tasks with few starting times, Reports in operation research and system theory M92-06, Maastricht University.
19. A. Vazacopoulos, N. Verma, Hybrid LP-CP techniques to solve a multi-machine assignment and scheduling problem. "Supply Chain Optimization", Editors: Joseph Geunes and Panos Pardalos (forthcoming).