The K king problem, an abstract model for computing aircraft landing trajectories: On modeling a dynamic hybrid system with constraints

INFORMS Journal on Computing

Volumn 20, Issue 2, 2008, Pages 222-233

  Artiouchine, Konstantin ^a,b   Baptiste, Philippe ^b   Mattioli, Juliette ^a  

^a THALES RESEARCH AND TECHNOLOGY   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Air traffic control; Constraint programming; Scheduling

Indexed keywords

EID: 61349107226     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0234     Document Type: Article

References (17)

1. Artiouchine, K., P. Baptiste. 2005. Interdistance constraint: An extension of the all-different constraint for scheduling equal length jobs. P. van Beek, ed. Proc. Eleventh Internat, Conf. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 3709. Springer-Verlag, Berlin, 62-76.
2. Artiouchine, K., P. Baptiste, C. Dürr. 2004. Runway sequencing with holding patterns. Eur. J. Oper. Res. Forthcoming.
3. Baptiste, P., C. Le Pape. 1996. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. Proc. Fifteenth Workshop of the UK Planning Special Interest Group, Liverpool, UK.
4. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling. Kluwer Academic Publishers, Norwell, MA.
5. Barták, R., R. Erben. 2004. A new algorithm for singleton arc consistency. V. Barr, Z. Markov, eds. Proc. Florida Artificial Intelligence Res. Soc., Miami, FL. AAAI Press, Menlo Park, CA, 257-262.
6. Beasley, J. E., M. Krishnamoorthy, Y. M. Sharaiha, D. Abramson. 2000. Scheduling aircraft landings-the static case. Transportation Sci. 34 180-197.
7. Bessiere, C, R. Debruyne. 2004. Theoretical analysis of singleton arc consistency. B. Hnich, T. Walsh, eds. Proc. ECAI-04 Workshop on Modeling and Solving Problems with Constraints, Valencia, Spain, 20-29.
8. Bessière, C, J.-C. Régin. 1997. Arc consistency for general constraint networks: Preliminary results. Proc. International Joint Conferences on Artificial Intelligence, Nagoya, Japan, 398-404.
9. Carlier, J., E. Pinson. 1990. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Ann. Oper. Res. 26 269-287.
10. Carlier, J., E. Pinson. 1994. Adjustments of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78 146-161.
11. Martin, P. D., D. B. Shmoys. 1996. A new approach to computing optimal schedules for the job-shop scheduling problem. W. H. Cunningham, S. T. McCormich, M. Queyranne, eds. Proc. 5th International IPCO Conference, Lecture Notes in Computer Science, Vol. 1084. Springer, Berlin, 389-403.
12. Puget, J.-F. 1998. A fast algorithm for the bound consistency of alld- iff constraints. Proc. Fifteenth National Conf. Artificial Intelligence. AAAI Press, Menlo Park, CA, 359-366.
13. Quimper, C.-G., A. López-Ortiz, G. Pesant. 2006. A quadratic propagator for the interdistance constraint. Proc. 21st National Conference on Artificial Intelligence (AAAI-06), Boston.
14. Regin, J.-C. 1995. Développement d'outils algorithmiques pour l'Intelligence Artificielle. application à la chimie organique. Ph.D. thesis, Université Montpellier 2, Montpellier, France.
15. Schiex, T., G. Verfaillie. 1994. Nogood recording for static and dynamic constraint satisfaction problem. Internal. J. Artificial Intelligence Tools 3 187-207.
16. Torres, P., P. Lopez. 2000. On not-first/not-last conditions in disjunctive scheduling. Eur. J. Oper. Res. 127 332-343.
17. Vilím, P. 2004. o(n log n) filtering algorithms for unary resource constraint. J.-C. Regin, M. Rueher, eds. Proc. CP-AI-OR, Lecture Notes in Computer Science, Vol. 3011. Springer-Verlag, Berlin, 335-347.