A Heuristic Algorithm for Solving the Faculty Assignment Problem

作     者：Manar I. Hosny 

作者机构：Computer Science Department College of Computer and Information Sciences King Saud University Riyadh 11495Saudi Arabia 

出 版 物：《通讯和计算机（中英文版）》 (Journal of Communication and Computer)

年 卷 期：2013年第10卷第3期

页      码：287-294页

摘      要：In this paper the author describes a heuristi-based algorithm for the faculty assignment problem. The algorithm was designed and implemented as part of a graduation project in the IT Department of King Saud University, Riyadh, Saudi Arabia. The purpose of the project was to automate the manual tedious process of assigning TAs (teaching assistants) to suitable lab sessions, a task that needs to be done every semester in the IT Department. The algorithm was designed to fulfill the assignment task while taking into consideration a number of constraints pertaining to both the TAs (e. g. personal preference and available hours) and the IT Department (e. g. maximum allowed workload). The problem definition, the algorithm and the experimental results are thoroughly explained in this paper. The computational experimentation indicates the efficiency of the proposed algorithm in assigning courses that conform to the preferences of the TAs and the rules set forth by the IT Department.

主 题 词：启发式算法 分配问题 沙特阿拉伯 IT部门 师资 算法设计 实验课 毕业设计 

学科分类：12[管理学] 1201[管理学-管理科学与工程类] 07[理学] 070105[070105] 0701[理学-数学类] 

馆 藏 号：203119514...