Monte Zweben

AIJ Journal 1992 Journal Article

Learning to improve constraint-based scheduling

• Monte Zweben
• Eugene Davis
• Brian Daun
• Ellen Drascher
• Michael Deale
• Megan Eskey

AAAI Conference 1990 Conference Paper

Learning Search Control for Constraint-Based Scheduling

• Megan Eskey
• Monte Zweben

This paper describes an application of an analytical learning technique, Plausible Explanation-Based Learning (PEB L), that dynamically acquires search control knowledge for a constraint-based scheduling system. In general, the efficiency of a scheduling system suffers because of resource contention among activities. Our system learns the general conditions under which chronic contention occurs and uses search control to avoid repeating mistakes. Because it is impossible to prove that a chronic contention will occur with only one example, traditional EBL techniques are insufficient. We extend classical EBL by adding an empirical component that creates search control rules only when the system gains enough confidence in the plausible explanations. This extension to EBL was driven by our observations about the behavior of our scheduling system when applied to the real-world problem of scheduling tasks for NASA Space Shuttle payload processing. We demonstrate the utility of this approach and provide experimental results.

IJCAI Conference 1989 Conference Paper

Constraint Satisfaction with Delayed Evaluation

• Monte Zweben
• Megan Eskey

This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avoid unnecessary computation. The architecture used is a uniform model of computation, where each constraint contributes its local information to provide a global solution. We demonstrate the utility of the system by formulating a real-world scheduling problem as a constraint satisfaction problem (CSP).