Generalized assignment type goal programming problem: Application to nursescheduling

Authors
Ferland, JA Berrada, I Nabli, I Ahiod, B Michelon, P Gascon, V Gagne, E
Citation
Ja. Ferland et al., Generalized assignment type goal programming problem: Application to nursescheduling, J HEURISTIC, 7(4), 2001, pp. 391-413
Citations number
20
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
JOURNAL OF HEURISTICS
ISSN journal
13811231 → ACNP
Volume
7
Issue
4
Year of publication
2001
Pages
391 - 413
Database
ISI
SICI code
1381-1231(2001)7:4<391:GATGPP>2.0.ZU;2-A
Abstract
The notion of the Generalized Assignment Type Goal Programming Problem is i ntroduced to consider the additional side constraints of an Assignment Type problem as goal functions. A short term Tabu Search method together with d iversification strategies are used to deal with this model. The methods are tested on real-world Nurse Scheduling Problems.