Franses, P. and Gerhard, P. (2003) Personnel Scheduling in Laboratories. In: Burke, E. and De Causmaecker, P., Eds., Practice and Theory of Automated Timetabling IV, Vol. 2740, Lecture Notes in Computer Science, Springer Berlin, Heidelberg, 113-119.

has been cited by the following article:

• TITLE: Proposed Heuristic Method for Solving Assignment Problems

  AUTHORS: S. K. Amponsah, D. Otoo, S. Salhi, E. Quayson

  KEYWORDS: Assignment Problem, Hungarian Algorithm, Heuristic

  JOURNAL NAME: American Journal of Operations Research, Vol.6 No.6, November 14, 2016

  ABSTRACT: 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.