Object-oriented constraint logic programming for timetable planning

Abstract

This paper deals with an object-oriented approach to analysis, design, and implementation of constraint logic programming (CLP) for a timetabling system (TTS). Currently, it is difficult to maintain and port such systems to different environments. This is because by nature, timetabling problems are combinatorial, dynamics, and optimization-based. Using a conventional approach, changes to organization's policies and activities require updating of the model. Subsequently, computer programs need to be updated accordingly. These tasks have to be performed by experts who are scarcely available. In this paper, we show that maintainability and extendibility of object-oriented technologies enhance model formulation and maintenance by inheritance and polymorphism properties of classes and objects. The object-oriented approach also enhances constraint propagation and search by object interactions and communications. These advantages can be applied to other similar optimization-based systems such as planning and scheduling.