Adaptive Constraint-Based Agents in Artificial Environments

[JOB-SHOP]   [Realization]   [Results]   [Constraint Weights]

[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]


(Related publications: [PUBLink] [PUBLink])

The dynamic job-shop scheduling problem was encoded according to the global constraint concept. There are two types of global constraints:

Decomposition into these types of constraints is done because of the strong dependencies among the variables for each constraint and the manifold reuse possibilities. Resource constraints that hinder a temporal overlap of activities/assignments are needed in many applications, e.g., to model the availability of a person, a room or a machine, and the TC's temporal relations of tasks/activities are needed in nearly every system that involves temporal reasoning. The ARCs and TCs will also be used for the EXCALIBUR agent's planning system.


[JOB-SHOP]   [Realization]   [Results]   [Constraint Weights]

For questions, comments or suggestions, please contact us.

Last update:
May 19, 2001 by Alexander Nareyek