An Optimal Assignment Schedule of Staff-Subject Allocation
- 1 Department of Mathematics and Computer Science, Sule Lamido University, Kafin Hausa, Nigeria
- 2 Department of Economics and Developmental Studies, Federal University, Dutse, Nigeria
- 3 Department of Mathematics, Federal University, Dutse, Nigeria
- 4 Department of Mathematics, Federal University, Dutse, Nigeria
Abstract
This research is an optimal allocation of assignment schedule in science subjects. Two methods of assignment problem were used, namely; the Hungarian method (Algorithm) and Linear interactive & discrete optimization (LINGO) technique. The results from both methods yielded the same optimal outcome. It reveals that the total minimum opportunity that will maximize the educational quality is 84 and the total maximum effectiveness that will maximize the educational quality is 416. Therefore, we recommend to the school management to adopt these methods in staff-subject allocation schedule to science, management and arts subjects for optimal benefits. Accordingly, the government should also apply the findings of this research to other schools.
- Kaye, S. (1985) Combinatorial Optimization: Algorithms and Complexity. Dover Books, 27-31.
- Srinivas, B. and Ganesan, G. (2015) Method for Solving Branch-and-Bound Techniques for Assignment Problems Using Triangular and Trapezoidal Fuzzy Numbers. International Journal of Management and Social Science, 3(3): 7-10. Retrieved 23rd Nov, 2015, from https://www.researchgate.net
- Ahmad, A. and Ahmad A. (2014) A New Method for Finding an Optimal Solution of Assignment Problems. International Journal of Modern Mathematics Sciences, 12(1): 10-15. Retrieved December 9, 2015, from http://modernscientificpress.com/journals/ijmms.aspx
- Loomba, P.N. (1964) Linear Programming. McGraw-Hill, New York, 31-39.
- Chevatal, V. (1983) Linear Programming Techniques. Freeman and Company, New York, 2nd Edition, 15-20.
- Ignizio, J.P. (1982) Linear Programming in Single and Multiple Objective System. Prentice Hall International, Inc., New Jersey, 17-27.
- Willams, H.P. (1995) Model Building in Mathematical Programming. Wiley, UK.
- Simon, K. (2012) Staff Assignment Problem. Unpublished M.Sc. Thesis, Institute of Distance Learning, Ghana.
- De, P.K. and Yadav, B. (2012) A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients. Journal of Modern Applied Science, 6, 8-14. Retrieved December 25, 2015, from https://www.researchgate.net http://doi.org/10.5539/mas.v6n3p2
- Ghadle, K.P. and Muley, Y.M. (2013) Revised Ones Assignment Method for Solving Assignment Problem. Journals of Statistics and Mathematics, 4(1): 7-12. Retrieved January 25, 2016, from https://bioinfopublication.org/jouarchive.php?opt=&jouid=BPJ0000285
- Thiruppathi, A. and Iranian, D. (2015) An Innovative Method for Finding Optimal to Assignment Problems. International Journal of Innovative Research in Sciences Engineering and Technology, 4, 9-11.
- Michael, N., Zavlanos, M., Kumar, V. and Pappas, G. (2008) Distributed Multi-Robot Assignment and Formation Control. IEEE International Conference on Robotics and Automation, Pasadena, 19-23 May 2008, 128-133. https://doi.org/10.1109/ROBOT.2008.4543197
- Majundar, S. (2013) Interval Linear Assignment Problems. Journal of Applied Mathematics, 1, 14-16. http://www.hrpub.org
- Kotwal, J.G and Dhope, T.S. (2015) Unbalanced Assignment Problem Using Modified Approach. International Journal of Advanced Research in Computer Science and Software Engineering, 5, 4-11. http://www.ijarcsse.com