Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Recent Developments in Practical Examination Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Experiments on Networks of Employee Timetabling Problems
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
| Hi-index | 0.00 |
Resource allocation problems (RAPs)are naturally represented as constraint networks (CNs), with constraints of inequality among activities that compete for the same resources at the same time [5]. A large variety of timetabling problems can be formulated as CNs with inequality constraints (representing time conflicts among classes of the same teacher, for example). A new algorithm for solving networks of RAPs is described and its detailed behavior is presented on a small example. The proposed algorithm delays assignments of resources to selected activities and processes the network during the assignment procedure, to select delays and values. The proposed algorithm is an enhancement to standard intelligent backtracking algorithms [13], is complete and performs better than two former approaches to solving CNs of resource allocation [15], [3], [4]. Results of comparing the proposed resource assignment algorithm to other ordering heuristics, on randomly generated networks, are reported.