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

被引：17

作者：

Ferland, JA

Berrada, I

Nabli, I

Ahiod, B

Michelon, P

Gascon, V

Gagné, É

机构：

[1] Univ Montreal, Dept Informat & Rech Operat, Montreal, PQ H3C 3J7, Canada

[2] Ecole Natl Super Informat & Anal Syst, Rabat, Morocco

[3] Univ Montreal, Montreal, PQ, Canada

[4] Fac Sci Rabat, Rabat, Morocco

[5] Univ Avignon, Avignon, France

[6] Univ Quebec, Trois Rivieres, PQ GA9 5H7, Canada

[7] IBM Serv Mondiaux, Montreal, PQ, Canada

来源：

JOURNAL OF HEURISTICS | 2001年 / 7卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

assignment; goal programming; Tabu Search; diversification; nurse scheduling;

D O I：

10.1023/A:1011392328632

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：391 / 413

页数：23

共 20 条

[1]

AHIOD B, 1997, THESIS U MOHAMMED 5

[2] A multi-objective approach to nurse scheduling with both hard and soft constraints [J].