Collaborating Authors

Issues in the Design of AI-Based Schedulers: A Workshop Report

AI Magazine

The concatenation of these reports forms the body of this article. Abstract Based on the experience in manufacturing production scheduling problems which the AI community has amassed over the last ten years, a workshop was held to provide a forum for discussion of the issues encountered in the design of AIbased scheduling systems. Several topics were addressed including: the relative virtues of expert system, deep method, and interactive approaches, the balance between predictive and reactive components in a scheduling system, the maintenance of convenient scheduling descriptions, the application of the ideas of chaos theory to scheduling, the state of the art in schedulers which learn, and the practicality and desirability of a set of benchmark scheduling problems. This article expands on these issues, abstracts the papers which were presented, and summarizes the lengthy discussions that took place. Since its first formal business meeting in August of 1988, the American Association for Artificial Intelligence Special Interest Group in Manufacturing (SIGMAN) has held a number of workshops, three of which have been concerned with the application of AI techniques to the problem of manufacturing scheduling.

AI-Based Schedulers in Manufacturing Practice: Report of a Panel Discussion

AI Magazine

There is a great disparity between the number of papers which have been published about AI-based manufacturing scheduling tools and the number of systems which are in daily use by manufacturing engineers. It is argued that this is not a reflection of inadequate AI technology, but is rather indicative of lack of a systems perspective by AI practitioners and their manufacturing customers. Case studies to support this perspective are presented by Carnegie Group as a builder of scheduling systems for its customers, by Texas Instruments and Intel Corporation as builders of schedulers for their own use, and by Intellection as a consulting house specializing in scheduling problems.


AI Magazine

He holds a B.S. degree in Mathematics from Westminster College, and M.S. and Ph.D. degrees in Computer Science from the University of Pittsburgh. His research interests include constraint-based planning and scheduling, integration of predictive and reactive decision-making, distributed problem solving, temporal reasoning, machine learning, and knowledge-based production management. He has been a principal architect of several knowledge-based scheduling systems for complex manufacturing and space applications. Claude Le Pape is a visiting researcher in the Robotics Laboratory at Stanford University. He received a Ph.D. in Computer Science from University Paris XI in 1988.

Constructing and Maintaining Detailed Production Plans: Investigations into the Development of K-B Factory Scheduling

AI Magazine

To be useful in practice, a factory production schedule must reflect the influence of a large and conflicting set of requirements, objectives and preferences. Human schedulers are typically overburdened by the complexity of this task, and conventional computer-based scheduling systems consider only a small fraction of the relevent knowledge. This article describes research aimed at providing a framework in which all relevant scheduling knowledge can be given consideration during schedule generation and revision. Factory scheduling is cast as a complex constraint-directed activity, driven by a rich symbolic model of the factory environment in which various influencing factors are formalized as constraints. A variety of constraint-directed inference techniques are defined with respect to this model to provide a basis for intelligently compromising among conflicting concerns. Two knowledge-based factory scheduling systems that implement aspects of this approach are described.

A Predictive Model for Satisfying Conflicting Objectives in Scheduling Problems

AI Magazine

The economic viability of a manufacturing organization depends on its ability to maximize customer services; maintain efficient, low-cost operations; and minimize total investment. These objectives conflict with one another and, thus, are difficult to achieve on an operational basis. Much of the work in the area of automated scheduling systems recognizes this problem but does not address it effectively. The work presented by this Ph.D. dissertation was motivated by the desire to generate good, cost-effective schedules in dynamic and stochastic manufacturing environments.