Article ID: | iaor19921745 |
Country: | Netherlands |
Volume: | 35 |
Issue: | 2 |
Start Page Number: | 313 |
End Page Number: | 323 |
Publication Date: | Mar 1992 |
Journal: | Discrete Applied Mathematics |
Authors: | Tripathy Arabinda |
Keywords: | computers: information, artificial intelligence: decision support |
Timetabling is a large and complex problem. In the absence of a precise objecive function, the solution process mostly aims at obtaining a feasible solution. There is a quality aspect of timetabling which is often not taken care of explicitly. This is due to the fact that the quality is largely the perception of the decision maker. This necessitates interaction of the decision maker during the generation of timetable through a computer. Case data of a timetabling problem have been analysed. The special characteristics of the problem is the highly dense conflict matrix. The computer is used in aiding the decision maker to arrive at a desirable timetable.