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é
Affiliations:
DIRO, Université de Montréal, C.P. 6128, Succ. Centre-ville, Montréal (Québec), Canada H3C 3J7. ferland@iro.umontreal.ca;École Nationale Supérieure d'Informatique et d'Analyse des Systèmes, Rabat, Morocco;Université de Montréal, Montréal, Québec, Canada;Faculté des Sciences de Rabat, Morocco;Université d'Avignon, Avignon, France;Université du Québec à Trois-Rivières, Trois-Rivières, Québec, Canada;IBM Services Mondiaux, Montréal, Québec, Canada
Venue:
Journal of Heuristics
Year:
2001

Citing 7
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Exchanges procedures for timetabling problems

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Tabu search

Modern heuristic techniques for combinatorial problems
A study of diversification strategies for the quadratic assignment problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Generalized Assignment-Type Problems: A Powerful Modeling Scheme

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II

Quantified Score

Hi-index	0.00

Visualization

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.