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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahiod, B. (1997). “Adaptation de certaines heuristiques pour résoudre le problème du personnel infirmier dans un établissement hospitalier.” Thèse de troisième cycle, Faculté des Sciences, Université Mohammed V, Rabat, Maroc.
Berrada, I. (1993). “Planification d'horaires du personnel infirmier dans un établissement hospitalier.” Ph.D. Dissertation, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal.
Berrada, I., J.A. Ferland, and P. Michelon. (1996). “A Multi-Objective Approach to Nurse Scheduling with both Hard and Soft Constraints.” Socio-Economic Planning Science 30, 183–193.
Bodin, L.D., B.L. Golden, A.A. Assad, and M. Ball. (1983). “Routing and Scheduling of Vehicles and Crews: The State of the Art.” Computers and Operations Research 10, 69–211.
Ferland, J.A. (1997). “Generalized Assignment-Type Problems, A Powerful Modeling Scheme,” Practice and Theory of Automated Time tabling II (E. Burke and M. Carter eds.) Springer Lecture Notes in Computer Science 1408, 53–77.
Ferland, J.A., A. Hertz, and A. Lavoie (1996). “An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques.” Operations Research 44, 347–359.
Ferland, J.A. and A. Lavoie. (1992). “Exchanges Procedures for Timetabling Problems.” Discrete Applied Mathematics 35, 237–253.
Fleurent, C. and J.A. Ferland. (1996). “Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability.” DIMACS Series in Mathematics and Theoretical Computer Science 26, 619–652.
Gagné, E. (1996). “Application d'une méthode exacte pour la génération d'horaire en soins infirmiers.” M.Sc. Thesis, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal.
Geoffrion, A.M. (1968). “Proper Efficiency and Theory ofVector Maximization,” Journal of Mathematical Analysis and Applications 22, 618–630.
Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers and Operations Research 13, 533–549.
Glover, F. and M. Laguna. (1993). “Tabu Search.” In C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Oxford Blackwell Publishing, pp. 70–150.
Hansen, P. (1986). “The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming.” Congrès sur les Méthodes Numériques en Optimisation Combinatoire, Capri, Italy. Hertz, A. and D. deWerra. (1987). “Using Tabu Search Techniques for Graph Coloring.” Computing 39, 345–351.
Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Shevon. (1989). “Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning.” Operations Research 37, 865–892.
Kelly, J.P., M. Laguna, and F. Glover. (1994). “A Study of Diversification Strategies for the Quadratic Assignment Problem.” Computers and Operations Research 21, 885–893.
Nabli, I. (1995). “Horaires du personnel infirmier générés avec approches heuristiques.” M.Sc. Thesis,D´epartement d'Informatique et de Recherche Opérationnelle, Université de Montréal.
Sherali, H.D. (1981). “Equivalent Weights for Lexicographic Multi-objective Programs: Characterizations and Computations.” European Journal of Operational Research 11, 367–379.
Steuer, R.E. (1989). Multiple Criteria Optimization: Theory, Computation, and Application, Malabar, FL: Krieger Publishing Co.
Ross, C.T. and R.M. Soland. (1975). “A Branch and Bound Algorithm for the Generalized Assignment Problem.” Mathematical Programming 8, 91–103.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ferland, J.A., Berrada, I., Nabli, I. et al. Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. Journal of Heuristics 7, 391–413 (2001). https://doi.org/10.1023/A:1011392328632
Issue Date:
DOI: https://doi.org/10.1023/A:1011392328632