Generalized assignment type goal programming problem:: Application to nurse scheduling

作     者：Ferland, JA Berrada, I Nabli, I Ahiod, B Michelon, P Gascon, V Gagné, É 

作者机构：Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada Ecole Natl Super Informat & Anal Syst Rabat Morocco Univ Montreal Montreal PQ Canada Fac Sci Rabat Rabat Morocco Univ Avignon Avignon France Univ Quebec Trois Rivieres PQ GA9 5H7 Canada IBM Serv Mondiaux Montreal PQ Canada 

出 版 物：《JOURNAL OF HEURISTICS》 (试探法杂志)

年 卷 期：2001年第7卷第4期

页      面：391-413页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：FRSQ, (930913) Natural Sciences and Engineering Research Council of Canada, NSERC, (OGP 0008312) Fonds pour la Formation de Chercheurs et l'Aide à la Recherche, FCAR, (93BR1654) 

主　　题：assignment goal programming Tabu Search diversification nurse scheduling 

摘      要：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.