The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints

References

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