13 January 2012 A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments
Author Affiliations +
Abstract
The general formulation of the assignment problem consists in the optimal allocation of a given set of tasks to a workforce. This problem is covered by existing literature for different domains such as distributed databases, distributed systems, transportation, packets radio networks, IT outsourcing, and teaching allocation. This paper presents a new version of the assignment problem for the allocation of academic tasks to staff members in departments with long leave opportunities. It presents the description of a workload allocation scheme and its algorithm, for the allocation of an equitable number of tasks in academic departments where long leaves are necessary.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. D. Eyono Obono, S. D. Eyono Obono, Sujit Kumar Basak, Sujit Kumar Basak, } "A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments", Proc. SPIE 8350, Fourth International Conference on Machine Vision (ICMV 2011): Computer Vision and Image Analysis; Pattern Recognition and Basic Technologies, 83502Q (13 January 2012); doi: 10.1117/12.920261; https://doi.org/10.1117/12.920261
PROCEEDINGS
8 PAGES


SHARE
Back to Top