|
|||||
|
|
Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling |
|
| Authors: | Jacques A Ferland Ilham Berrada Imene Nabli B Ahiod Philippe Michelon Viviane Gascon Éric Gagné |
| Institution: | (1) DIRO, Université de Montréal, C.P. 6128, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3J7;(2) Informatique et d'Analyse des Systèmes, École Nationale Supérieure d', Rabat, Morocco;(3) Université de Montréal, Montréal, Québec, Canada;(4) Faculté des Sciences de Rabat, Morocco;(5) Université d'Avignon, Avignon, France;(6) Université du Québec à Trois-Rivières, Trois-Rivières, Québec, Canada;(7) IBM Services Mondiaux, Montréal, Québec, Canada |
| Abstract: | 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. |
| Keywords: | assignment goal programming Tabu Search diversification nurse scheduling |
| 本文献已被 SpringerLink 等数据库收录！ | |