{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:15:08Z","timestamp":1777090508575,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":["Applied Intelligence"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1011291030731","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:18:21Z","timestamp":1040635101000},"page":"199-214","source":"Crossref","is-referenced-by-count":144,"title":["A Memetic Approach to the Nurse Rostering Problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Edmund","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"De Causmaecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet Vanden","family":"Berghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"354286_CR1","unstructured":"K. Dowsland, \u201cNurse scheduling with tabu search and strategic oscillation,\u201d EJOR to appear."},{"key":"354286_CR2","doi-asserted-by":"crossref","unstructured":"A. Meisels, E. Gudes, and G. Solotorevski, \u201cEmployee timetabling, constraint networks and knowledge-based rules: A mixed approach.\u201d In Proc. Practice and Theory of Automated Timetabling, First International Conference Edinburgh, pp. 93-105, 1995.","DOI":"10.1007\/3-540-61794-9_53"},{"key":"354286_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0010-4809(88)90042-0","volume":"21","author":"M. Okada","year":"1988","unstructured":"M. Okada, \u201cProlog-based system for nursing staff scheduling implemented on a personal computer,\u201d Computers and Biomedical Research, vol. 21, pp. 53-63, 1988.","journal-title":"Computers and Biomedical Research"},{"key":"354286_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0010-4809(92)90002-R","volume":"25","author":"M. Okada","year":"1992","unstructured":"M. Okada, \u201cAn approach to the generalised nurse scheduling problem-Generation of a declarative program to represent institution-specific knowledge,\u201d Computers and Biomedical Research, vol. 25, pp. 417-434, 1992.","journal-title":"Computers and Biomedical Research"},{"key":"354286_CR5","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.24.5.857","volume":"24","author":"H. Miller","year":"1976","unstructured":"H. Miller, W. Pierskalla, and G. Rath, \u201cNurse scheduling using mathematical programming,\u201d Operations Research, vol. 24, pp. 857-870, 1976.","journal-title":"Operations Research"},{"issue":"9","key":"354286_CR6","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/mnsc.22.9.972","volume":"22","author":"V.M. Trivedi","year":"1976","unstructured":"V.M. Trivedi and M.Warner, \u201cA branch and bound algorithm for optimum allocation of float nurses,\u201d Management Science, vol. 22, no. 9, pp. 972-981, 1976.","journal-title":"Management Science"},{"key":"354286_CR7","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.24.5.842","volume":"24","author":"M. Warner","year":"1976","unstructured":"M.Warner, \u201cScheduling nursing personnel according to nursing preference: A mathematical programming approach,\u201d Operations Research, vol. 24, pp. 842-856, 1976.","journal-title":"Operations Research"},{"key":"354286_CR8","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/mnsc.19.4.411","volume":"19","author":"M. Warner","year":"1972","unstructured":"M.Warner and J. Prawda, \u201cA mathematical programming model for scheduling nursing personnel in a hospital,\u201d Management Science, vol. 19, pp. 411-422, 1972.","journal-title":"Management Science"},{"key":"354286_CR9","unstructured":"H. Meyer auf'm Hofe, \u201cConPlan\/SIEDAplan, Personnel Assignment as a Problem of Hierarchical Constraint Satisfaction,\u201d in Proc. PACT 97, pp. 257-271, 1997."},{"key":"354286_CR10","doi-asserted-by":"crossref","unstructured":"E.K. Burke, P. De Causmaecker, and G. Vanden Berghe, \u201cA hybrid tabu search algorithm for the nurse rostering problem,\u201d in Proc. Second Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'98) Springes Lecture Notes on AI, vol. 1585, pp. 186-194, 1998.","DOI":"10.1007\/3-540-48873-1_25"},{"key":"354286_CR11","first-page":"1","volume":"9","author":"P. Coppens","year":"1995","unstructured":"P. Coppens, \u201cGeautomatiseerde personeelsplanning bij het A.Z. Sint-Erasmus,\u201d GET info, vol. 9, pp. 1-3, 1995.","journal-title":"GET info"},{"issue":"1","key":"354286_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E.K. Burke","year":"1999","unstructured":"E.K. Burke and J.P. Newall, \u201cA multi-stage evolutionary algorithm for the timetable problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 3, no. 1, pp. 63-74, April 1999.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"354286_CR13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/59.852110","volume":"15","author":"E.K. Burke","year":"2000","unstructured":"E.K. Burke and A.J. Smith, \u201cHybrid evolutionary techniques for the maintenance scheduling problem,\u201d IEEE Transactions on Power Systems, vol. 15, no. 1, pp. 122-128, Feb. 2000.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"354286_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1162\/evco.1998.6.1.81","volume":"6","author":"E.K. Burke","year":"1998","unstructured":"E.K. Burke, J.P. Newall, and R.F. Weare, \u201cInitialisation strategies and diversity in evolutionary timetabling,\u201d Evolutionary Computation Journal (Special Issue on Scheduling), vol. 6, no. 1, pp. 81-103, 1998.","journal-title":"Evolutionary Computation Journal (Special Issue on Scheduling)"},{"issue":"3-4","key":"354286_CR15","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0360-8352(97)00247-7","volume":"33","author":"R.W. Cheng","year":"1997","unstructured":"R.W. Cheng and M. Gen, \u201cParallel machine scheduling problems using memetic algorithms,\u201d Computers & Industrial Engineering, vol. 33, no. 3-4, pp. 761-764, 1997.","journal-title":"Computers & Industrial Engineering"},{"key":"354286_CR16","first-page":"187","volume-title":"Parallel Computing and Transputer Applications","author":"P. Moscato","year":"1992","unstructured":"P. Moscato and M.G. Norman, \u201cA 'Memetic' appproach for the traveling salesman problem. Implementation of a computational ecology for combinatorial optimization on messagepassing systems,\u201d in Parallel Computing and Transputer Applications, edited by M. Valero, E. Onate, M. Jane, J.L. Larriba, and B. Suarez, IOS Press: Amsterdam, pp. 187-194, 1992."},{"key":"354286_CR17","doi-asserted-by":"crossref","unstructured":"B. Paechter, A. Cumming, M.G. Norman, and H. Luchian, \u201cExtensions to a memetic timetabling system,\u201d in Practice and Theory of Automated Timetabling, edited by E.K. Burke and P. Ross, Springer Lecture Notes in Computer Science, vol. 1153, pp. 251-265, 1996.","DOI":"10.1007\/3-540-61794-9_64"},{"key":"354286_CR18","doi-asserted-by":"crossref","unstructured":"N.J. Radcliffe and P.D. Surry, \u201cFormal memetic algorithms,\u201d in Evolutionary Computing, edited by T. Fogarty, Springer Lecture Notes in Computer Science, vol. 865, pp. 250-263, 1994.","DOI":"10.1007\/3-540-58483-8_1"},{"key":"354286_CR19","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/opre.21.3.693","volume":"22","author":"W.J. Abernathy","year":"1973","unstructured":"W.J. Abernathy, N. Baloff, J.C. Hershey, and S. Wandel, \u201cA three-stage manpower planning and scheduling model-A service-sector example,\u201d Operations Research, vol. 22, pp. 693-711, 1973.","journal-title":"Operations Research"},{"key":"354286_CR20","doi-asserted-by":"crossref","unstructured":"E.K. Burke, P. De Causmaecker, S. Petrovic, and G. Vanden Berghe, \u201cFitness evaluation for nurse scheduling problems,\u201d in Proc. Congress on Evolutionary Computation 2001 (CEC 2001), IEEE Press, pp. 1139-1146, 2001. 214 Burke et al.","DOI":"10.1109\/CEC.2001.934319"},{"key":"354286_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1136\/jech.44.4.307","volume":"44","author":"R.D.T. Farmer","year":"1990","unstructured":"R.D.T. Farmer and J. Emami, \u201cModels for forecasting hospital bed requirements in the acute sector,\u201d Journal of Epidemiology and Community Health, vol. 44, pp. 307-312, 1990.","journal-title":"Journal of Epidemiology and Community Health"},{"key":"354286_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1136\/jech.44.4.307","volume":"44","author":"P. Gemmel","year":"1990","unstructured":"P. Gemmel and P. Coppens, \u201cHospitalia, Tijdschrift verbond der Verzorgingsinstellingen (1996) in the acute sector,\u201d Journal of Epidemiology and Community Health, vol. 44, pp. 307-312, 1990.","journal-title":"Journal of Epidemiology and Community Health"},{"key":"354286_CR23","doi-asserted-by":"crossref","unstructured":"B. Paechter, A. Cumming, and H. Luchian, \u201cThe use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms,\u201d in Evolutionary Computation, edited by T. Fogarty, Springer Lecture Notes in Computer Science, vol. 993, pp. 86-93, 1995.","DOI":"10.1007\/3-540-60469-3_27"},{"key":"354286_CR24","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1057\/jors.1995.26","volume":"44","author":"A.P. Punnen","year":"1995","unstructured":"A.P. Punnen, and Y.P. Aneja, \u201cA tabu search algorithm for the resource-constrained assignment problem,\u201d Journal of the Operational Research Society, vol. 44, pp. 214-220, 1995.","journal-title":"Journal of the Operational Research Society"},{"key":"354286_CR25","unstructured":"S. Vanderhaeghe, \u201cDienstroosters in de gezondheidszorg: ongezond?\u201d Informatiedossier, Stichting Technologie Vlaanderen, 1998."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011291030731.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011291030731\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011291030731.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:01:25Z","timestamp":1747580485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011291030731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["354286"],"URL":"https:\/\/doi.org\/10.1023\/a:1011291030731","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}