A conditional randomized algorithms for university timetabling of teachers / (Record no. 189)

MARC details
000 -LEADER
fixed length control field 01569nam a2200241 4500
001 - CONTROL NUMBER
control field UPMIN-00000009115
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230208103025.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230208b |||||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency UPMin
Modifying agency upmin
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) LG993.5 2001
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) A64 P33
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Pabia, Jezreel K.
9 (RLIN) 2150
245 00 - TITLE STATEMENT
Title A conditional randomized algorithms for university timetabling of teachers /
Statement of responsibility, etc. Jezreel K. Pabia
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2001
300 ## - PHYSICAL DESCRIPTION
Extent 51 leaves
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001
520 3# - SUMMARY, ETC.
Summary, etc. This 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 ## - INDEX TERM--CURRICULUM OBJECTIVE
Main curriculum objective Undergraduate Thesis
Curriculum code AMAT200,
Source of term or code BSAM
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a Fi
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a UP
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Thesis
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Status Collection Home library Current library Shelving location Date acquired Source of acquisition Accession Number Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2001-08-07 donation UAR-T-gd076   LG993.5 2001 A64 P33 3UPML00020904 2022-09-21 2022-09-21 Thesis
    Library of Congress Classification   Not For Loan Room-Use Only College of Science and Mathematics University Library Theses 2003-06-04 donation CSM-T-gd686   LG993.5 2001 A64 P33 3UPML00010953 2022-09-21 2022-09-21 Thesis
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved