Abstract
We study the problem of scheduling a set of aircraft in the surtoundings of an airport. Aircraft are subjected to dynamic and spatial constraints and the runway is a single ressource that cannot be simultaneously shared. We elaborate and study a simplified model of the problem: The “N–King” problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Artiouchine, K. (2004). N–Kings for Dynamic Systems. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive