Cited By
View all- Ventura R(2016)Four Decades of AI in PortugalAI Magazine10.1609/aimag.v37i4.269437:4(107-109)Online publication date: 1-Dec-2016
Crews_ns: : Scheduling Train Crews in The Netherlands
Abstract
We present a system, crews_ns, that is used in the long‐term scheduling of drivers and guards for the Dutch Railways. crews_ns schedules the work of about 5000 people. crews_ns is built on top of crews, a scheduling tool for speeding the development of scheduling applications. crews heavily relies on the use of AI techniques and has been built as a white‐box system, in the sense that the planner can perceive what is going on, can interact with the system by proposing alternatives or querying decisions, and can adapt the behavior of the system to changing circumstances. Scheduling can be done in automatic, semiautomatic, or manual mode. crews has mechanisms for dealing with the constant changes that occur in input data, can identify the consequences of the change, and guides the planner in accommodating the changes in the already built schedules (rescheduling).
References
[1]
Bisiani, R. 1987. Beam Search. In Encyclopedia of Artificial Intelligence, ed. S. C. Shapiro, 56–58. New York: Wiley.
[2]
Cadete H., and Sousa S. 1994. Tratamento de Mudança em Sistemas de Escalamento (Handling Change in Scheduling Systems). SISCOG, Lisbon, Portugal.
[3]
Doyle J. 1979. A Truth‐Maintenance System. Artificial Intelligence 12(3): 231–272.
[4]
Fox, M. S. 1987. Constraint‐Directed Search: A Case Study of Job‐Shop Scheduling. San Francisco, Calif.: Morgan Kaufmann.
[5]
Linssen, C. 1995. Written communication. September, Utrecht, The Netherlands.
[6]
Martins, J. P., and Shapiro, S. C. 1988. A Model for Belief Revision. Artificial Intelligence 35(1): 25–79.
[7]
Morgado, E. M., and Martins, J. P. 1989. CREWS: A Crew‐Scheduling System. Paper presented at EXPERSYS‐89, Expert Systems Applications, 23–24 October, Paris.
[8]
Morgado, E. M., and Martins, J. P. 1992. Scheduling and Managing Crew in the Portuguese Railways. Expert Systems with Applications, an International Journal 5:301–321.
[9]
Morgado, E. M., and Martins, J. P. 1993. An AI‐Based Approach to Crew Scheduling. In Proceedings of the IEEE Conference on AI Applications, CAIA 93, 71–77. Washington, D.C.: Institute of Electrical and Electronics Engineers.
[10]
Morgado, E. M., and Martins, J. P. 1996. Managing Change in Scheduling Data. Computers in Railways V, Volume 1: Railway Systems and Management, 479–489. Southampton, U.K.: Computational Mechanics.
[11]
Notermans, M. 1996. Oral communication. October, Utrecht, The Netherlands.
[12]
van Aarle, J. 1996. Scheduling Crew in the Dutch Railways. Paper presented at the Transportation Seminar, October, Lisbon, Portugal.
[13]
Sadeh, N., and Fox, M. S. 1991. Variable‐ and Value‐Ordering Heuristics for Hard–Constraint‐Satisfaction Problems: An Application to Job‐Shop Scheduling, Technical Report, CMU‐RI, TR‐91‐23, The Robotics Institute, Carnegie Mellon University.
[14]
Smith, S. F. 1989. The OPIS Framework for Modeling Manufacturing Systems, Technical Report, TR‐CMU‐RI‐89‐10, The Robotics Institute, Carnegie Mellon Univ.
Recommendations
CREWS_NS: scheduling train crew in the Netherlands
AAAI'97/IAAI'97: Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligenceWe present a system, CREWS_NS, that is used in the long-term scheduling of drivers and guards of the Dutch Railways. CREWS_NS schedules the work of about 5,000 people. CREWS_NS is built on top of CREWS, a scheduling tool for speeding the development of ...
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
In this paper, we consider the problem of scheduling n deteriorating jobs with release dates on a single (batching) machine. Each job's processing time is a simple linear function of its starting time. The objective is to minimize the maximum lateness. ...
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
In this paper, we study a new primary-secondary bicriteria scheduling problem on identical machines. The primary objective is to minimize the total completion time of all jobs and the secondary objective is to minimize the maximum T-time of all machines,...
Comments
Information & Contributors
Information
Published In
© 1998 The Authors. AI Magazine published by John Wiley & Sons Ltd on behalf of Association for the Advancement of Artificial Intelligence.
Publisher
John Wiley & Sons, Inc.
United States
American Association for Artificial Intelligence
United States
Publication History
Published: 01 March 1998
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025
Other Metrics
Citations
Cited By
View all- Ventura R(2016)Four Decades of AI in PortugalAI Magazine10.1609/aimag.v37i4.269437:4(107-109)Online publication date: 1-Dec-2016