摘要：i. thi. paper the author descri.es a heuri.ti.based algori.hm for the faculty assi.nment problem. The algori.hm was desi.ned and i.plemented as part of a graduati.n project i. the i. Department of Ki.g Saud Uni.ersi.y, Ri.adh, Saudi.Arabi.. The purpose of the project was to automate the manual tedi.us process of assi.ni.g TAs (teachi.g assi.tants) to sui.able lab sessi.ns, a task that needs to be done every semester i. the i. Department. The algori.hm was desi.ned to fulfi.l the assi.nment task whi.e taki.g i.to consi.erati.n a number of constrai.ts pertai.i.g to both the TAs (e. g. personal preference and avai.able hours) and the i. Department (e. g. maxi.um allowed workload). The problem defi.i.i.n, the algori.hm and the experi.ental results are thoroughly explai.ed i. thi. paper. The computati.nal experi.entati.n i.di.ates the effi.i.ncy of the proposed algori.hm i. assi.ni.g courses that conform to the preferences of the TAs and the rules set forth by the i. Department.