000			01569nam a2200241 4500
001			UPMIN-00000009115
003			UPMIN
005			20230208103025.0
008			230208b |||||||| |||| 00| 0 eng d
040			_aDLC _cUPMin _dupmin
041			_aeng
090			_aLG993.5 2001 _bA64 P33
100	1		_aPabia, Jezreel K. _92150
245	0	0	_aA conditional randomized algorithms for university timetabling of teachers / _cJezreel K. Pabia
260			_c2001
300			_a51 leaves
502			_aThesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001
520	3		_aThis study aimed to come up with a heuristic algorithm for university course timetabling, which will produce conflict-free while providing alternatives for teachers and a control on the variance of teaching loads. Teachers are selected at random, but they are first required to meet certain conditions before their actual assignment. The algorithm seeks a feasible solution given the maximum allowed load per teacher and allows the user to evaluate the produced solution given the variance of the loads of the teachers. Using concepts from probabilities and limits, bounds were set so that the algorithm would not continue to search in vain for long periods of time. Constraints were also included to avoid specific unwanted results such as cycling. The implementation of the algorithm into a computer program using Turbo C is a secondary objective for this study.
658			_aUndergraduate Thesis _cAMAT200, _2BSAM
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c189 _d189