Generalized assignment type goal programming problem: Application to nurse scheduling
Journal of Heuristics, Volume 7, No. 4, Year 2001
Notification
URL copied to clipboard!
The notion of the Generalized Assignment Type Goal Programming Problem is introduced to consider the additional side constraints of an Assignment Type problem as goal functions. A short term Tabu Search method together with diversification strategies are used to deal with this model. The methods are tested on real-world Nurse Scheduling Problems.