Name
Abstract | ||
|---|---|---|
In this paper, an airport departure scheduling tool for aircraft is presented based on constraint satisfaction techniques. Airports are getting more and more congested with the available runway configuration as one of the most constraining factors. A possibility to alleviate this congestion is to assist controllers in the planning and scheduling process of aircraft. The prototype presented here is aimed to offer such assistance in the establishment of an optimal departure schedule and the planning of initial climb phases for departing aircraft. This goal is accomplished by modelling the scheduling problem as a constraint satisfaction problem, using ILOG Solver and Scheduler as an implementation environment. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S1571-0661(04)80797-7 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
constraint satisfaction problem,scheduling problem,constraint satisfaction | Constraint satisfaction,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Operations research,Theoretical computer science,Scheduling (production processes),Constraint satisfaction problem,Rate-monotonic scheduling,Dynamic priority scheduling | Journal |
Volume | ISSN | Citations |
76 | 1571-0661 | 14 |
PageRank | References | Authors |
1.31 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pim van Leeuwen | 1 | 19 | 2.41 |
| Henk Hesselink | 2 | 16 | 3.75 |
| Jos Rohling | 3 | 14 | 1.31 |