摘要
Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.
Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.
作者
S. K. Amponsah
D. Otoo
S. Salhi
E. Quayson
S. K. Amponsah;D. Otoo;S. Salhi;E. Quayson(Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana;Department of Mathematics and Statistics, University of Energy and Natural Recourses, Sunyani, Ghana;Management Science Group, University of Kent, Kent, UK)
