Constraint-directed search: a case study of job-shop scheduling
Constraint-directed search: a case study of job-shop scheduling
Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project (The Addison-Wesley series in artificial intelligence)
An expert systems based methodology for solving resource allocation problems
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Teaching a graduate expert systems course
ACM SIGCSE Bulletin
Ramp activity expert system for scheduling and co-ordination at an airport
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
RAPS: A Rule-Based Language for Specifying Resource Allocation and Time-Tabling Problems
IEEE Transactions on Knowledge and Data Engineering
Knowledge-Based Technology for Controlling Railway Stations
IEEE Expert: Intelligent Systems and Their Applications
Modeling waiting systems from domain expert specifications
WSC '05 Proceedings of the 37th conference on Winter simulation
The use of meta-heuristics for airport gate assignment
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A description is given of GATES, an expert system that assigns gates to arriving and departing flights at New York's John F. Kennedy International Airport (JFK). GATES uses flight information and knowledge about current constraints to produce possible gate assignment schedules. GATES is a constraint-satisfaction expert system. To make its decisions, it uses two types of production rule: permissive rules and conflict rules. Permissive rules determine when it's appropriate to consider a particular gate for a particular flight, and permit the system to search the next level of rules to obtain an assignment. Conflict rules determine when particular flights cannot be assigned to particular gates. System operators can modify schedules by retracting rules, adjusting tolerances, and deleting information. The system was developed for a PC, thereby providing an efficient and flexible user environment. The approach is extensible to various engineering and industrial problems where limited resources and weakly defined constraints exist and in which scheduling must occur.