TY - GEN
T1 - Assigning resources to constrained activities
AU - Meisels, Amnon
AU - Ovadia, Ella
PY - 2001/1/1
Y1 - 2001/1/1
N2 - 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.
AB - 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.
KW - Constraint-based methods
KW - Timetabling networks
UR - http://www.scopus.com/inward/record.url?scp=84889574863&partnerID=8YFLogxK
U2 - 10.1007/3-540-44629-x_13
DO - 10.1007/3-540-44629-x_13
M3 - Conference contribution
AN - SCOPUS:84889574863
SN - 3540424210
SN - 9783540424215
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 213
EP - 223
BT - Practice and Theory of Automated Timetabling III - Third International Conference, PATAT 2000, Selected Papers
A2 - Burke, Edmund
A2 - Erben, Wilhelm
PB - Springer Verlag
T2 - 3rd International Conference on the Practice and Theory of Automated Timetabling, PATAT 2000
Y2 - 16 August 2000 through 18 August 2000
ER -