Share Email Print
cover

Proceedings Paper

A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments
Author(s): S. D. Eyono Obono; Sujit Kumar Basak
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 13 January 2012
PDF: 8 pages
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
Show Author Affiliations
S. D. Eyono Obono, Durban Univ. of Technology (South Africa)
Sujit Kumar Basak, Durban Univ. of Technology (South Africa)


Published in SPIE Proceedings Vol. 8350:
Fourth International Conference on Machine Vision (ICMV 2011): Computer Vision and Image Analysis; Pattern Recognition and Basic Technologies
Safaa S. Mahmoud; Zhu Zeng; Yuting Li, Editor(s)

© SPIE. Terms of Use
Back to Top