REDOM: an OO language to define and on-line manipulate regulations in the resource (re)scheduling problem
✍ Scribed by K. Thrampoulidis; N. Diamantopoulos; E. Housos
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 830 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0038-0644
No coin nor oath required. For personal study only.
✦ Synopsis
In the class of (re)scheduling problems where humans constitute the main resource, the scheduling process is influenced by a great number of complex and frequently changing regulations. The complexity and the dynamic nature of these regulations impose the need for an efficient, flexible and user-friendly way to express and manage them. A solution to this problem, in the form of an object-oriented high-level language with semantics highly-tailored to the user needs, is presented. The language, called REDOM, can be applied to different scheduling application domains with a minimum degree of effort, because it is based on a generic meta-model of the resource scheduling problem. An application programming interface facilitates REDOM integration into existing scheduling systems. REDOM is currently being utilised by the DAYSY resource management system, that is implemented as a constraint satisfaction system based on a partial test-and-generate approach. The combination of REDOM and CHIP (Constraint Handling In Prolog), which was used for the implementation of the solution generation subsystem, resulted in a highly-efficient and flexible (re)scheduling system, well-accepted by users.