{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:54:36Z","timestamp":1772801676629,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1023\/a:1011392328632","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"391-413","source":"Crossref","is-referenced-by-count":22,"title":["Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling"],"prefix":"10.1007","volume":"7","author":[{"given":"Jacques A.","family":"Ferland","sequence":"first","affiliation":[]},{"given":"Ilham","family":"Berrada","sequence":"additional","affiliation":[]},{"given":"Imene","family":"Nabli","sequence":"additional","affiliation":[]},{"given":"B.","family":"Ahiod","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[]},{"given":"Viviane","family":"Gascon","sequence":"additional","affiliation":[]},{"given":"\u00c9ric","family":"Gagn\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"338233_CR1","volume-title":"Th\u00e8se de troisi\u00e8me cycle, Facult\u00e9 des Sciences","author":"B. Ahiod","year":"1997","unstructured":"Ahiod, B. (1997). \u201cAdaptation de certaines heuristiques pour r\u00e9soudre le probl\u00e8me du personnel infirmier dans un \u00e9tablissement hospitalier.\u201d Th\u00e8se de troisi\u00e8me cycle, Facult\u00e9 des Sciences, Universit\u00e9 Mohammed V, Rabat, Maroc."},{"key":"338233_CR2","unstructured":"Berrada, I. (1993). \u201cPlanification d'horaires du personnel infirmier dans un \u00e9tablissement hospitalier.\u201d Ph.D. Dissertation, D\u00e9partement d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al."},{"key":"338233_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0038-0121(96)00010-9","volume":"30","author":"I. Berrada","year":"1996","unstructured":"Berrada, I., J.A. Ferland, and P. Michelon. (1996). \u201cA Multi-Objective Approach to Nurse Scheduling with both Hard and Soft Constraints.\u201d Socio-Economic Planning Science 30, 183\u2013193.","journal-title":"Socio-Economic Planning Science"},{"key":"338233_CR4","first-page":"69","volume":"10","author":"L.D. Bodin","year":"1983","unstructured":"Bodin, L.D., B.L. Golden, A.A. Assad, and M. Ball. (1983). \u201cRouting and Scheduling of Vehicles and Crews: The State of the Art.\u201d Computers and Operations Research 10, 69\u2013211.","journal-title":"Computers and Operations Research"},{"key":"338233_CR5","doi-asserted-by":"crossref","unstructured":"Ferland, J.A. (1997). \u201cGeneralized Assignment-Type Problems, A Powerful Modeling Scheme,\u201d Practice and Theory of Automated Time tabling II (E. Burke and M. Carter eds.) Springer Lecture Notes in Computer Science 1408, 53\u201377.","DOI":"10.1007\/BFb0055881"},{"key":"338233_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/opre.44.2.347","volume":"44","author":"J.A. Ferland","year":"1996","unstructured":"Ferland, J.A., A. Hertz, and A. Lavoie (1996). \u201cAn Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques.\u201d Operations Research 44, 347\u2013359.","journal-title":"Operations Research"},{"key":"338233_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90247-8","volume":"35","author":"J.A. Ferland","year":"1992","unstructured":"Ferland, J.A. and A. Lavoie. (1992). \u201cExchanges Procedures for Timetabling Problems.\u201d Discrete Applied Mathematics 35, 237\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"338233_CR8","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1090\/dimacs\/026\/29","volume":"26","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C. and J.A. Ferland. (1996). \u201cObject-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability.\u201d DIMACS Series in Mathematics and Theoretical Computer Science 26, 619\u2013652.","journal-title":"DIMACS Series in Mathematics and Theoretical Computer Science"},{"key":"338233_CR9","unstructured":"Gagn\u00e9, E. (1996). \u201cApplication d'une m\u00e9thode exacte pour la g\u00e9n\u00e9ration d'horaire en soins infirmiers.\u201d M.Sc. Thesis, D\u00e9partement d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al."},{"key":"338233_CR10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"A.M. Geoffrion","year":"1968","unstructured":"Geoffrion, A.M. (1968). \u201cProper Efficiency and Theory ofVector Maximization,\u201d Journal of Mathematical Analysis and Applications 22, 618\u2013630.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"338233_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). \u201cFuture Paths for Integer Programming and Links to Artificial Intelligence.\u201d Computers and Operations Research 13, 533\u2013549.","journal-title":"Computers and Operations Research"},{"key":"338233_CR12","unstructured":"Glover, F. and M. Laguna. (1993). \u201cTabu Search.\u201d In C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Oxford Blackwell Publishing, pp. 70\u2013150."},{"key":"338233_CR13","doi-asserted-by":"crossref","unstructured":"Hansen, P. (1986). \u201cThe Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming.\u201d Congr\u00e8s sur les M\u00e9thodes Num\u00e9riques en Optimisation Combinatoire, Capri, Italy. Hertz, A. and D. deWerra. (1987). \u201cUsing Tabu Search Techniques for Graph Coloring.\u201d Computing 39, 345\u2013351.","DOI":"10.1007\/BF02239976"},{"key":"338233_CR14","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Shevon. (1989). \u201cOptimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning.\u201d Operations Research 37, 865\u2013892.","journal-title":"Operations Research"},{"key":"338233_CR15","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","volume":"21","author":"J.P. Kelly","year":"1994","unstructured":"Kelly, J.P., M. Laguna, and F. Glover. (1994). \u201cA Study of Diversification Strategies for the Quadratic Assignment Problem.\u201d Computers and Operations Research 21, 885\u2013893.","journal-title":"Computers and Operations Research"},{"key":"338233_CR16","unstructured":"Nabli, I. (1995). \u201cHoraires du personnel infirmier g\u00e9n\u00e9r\u00e9s avec approches heuristiques.\u201d M.Sc. Thesis,D\u00b4epartement d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al."},{"key":"338233_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0377-2217(82)90202-8","volume":"11","author":"H.D. Sherali","year":"1981","unstructured":"Sherali, H.D. (1981). \u201cEquivalent Weights for Lexicographic Multi-objective Programs: Characterizations and Computations.\u201d European Journal of Operational Research 11, 367\u2013379.","journal-title":"European Journal of Operational Research"},{"key":"338233_CR18","volume-title":"Multiple Criteria Optimization: Theory, Computation, and Application","author":"R.E. Steuer","year":"1989","unstructured":"Steuer, R.E. (1989). Multiple Criteria Optimization: Theory, Computation, and Application, Malabar, FL: Krieger Publishing Co."},{"key":"338233_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"C.T. Ross","year":"1975","unstructured":"Ross, C.T. and R.M. Soland. (1975). \u201cA Branch and Bound Algorithm for the Generalized Assignment Problem.\u201d Mathematical Programming 8, 91\u2013103.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011392328632.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011392328632\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011392328632.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:10:34Z","timestamp":1747653034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011392328632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["338233"],"URL":"https:\/\/doi.org\/10.1023\/a:1011392328632","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}