{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:01:37Z","timestamp":1775005297683,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T00:00:00Z","timestamp":1184889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,8,22]]},"DOI":"10.1007\/s10479-007-0202-4","type":"journal-article","created":{"date-parts":[[2007,7,18]],"date-time":"2007-07-18T23:18:30Z","timestamp":1184800710000},"page":"279-288","source":"Crossref","is-referenced-by-count":60,"title":["Solving the multi-objective nurse scheduling problem with a weighted cost function"],"prefix":"10.1007","volume":"155","author":[{"given":"D.","family":"Parr","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,20]]},"reference":[{"key":"202_CR1","unstructured":"Abdennadher, A., & Schlenker, H. (1999). Nurse scheduling using constraint logic programming. In Eleventh annual conference on innovative applications of artificial intelligence (IAAI)."},{"key":"202_CR2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D. (1991). Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science, 37, 98\u2013113.","journal-title":"Management Science"},{"key":"202_CR3","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2004","unstructured":"Aickelin, U., & Dowsland, K. A. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research, 31, 761\u2013778.","journal-title":"Computers and Operations Research"},{"key":"202_CR4","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1287\/mnsc.20.12.1561","volume":"20","author":"K. Baker","year":"1974","unstructured":"Baker, K. (1974). Scheduling a full time workforce to meet cyclic staffing requirements. Management Science, 20, 1561\u20131568.","journal-title":"Management Science"},{"key":"202_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/mnsc.24.2.161","volume":"24","author":"K. Baker","year":"1977","unstructured":"Baker, K., & Magazine, M. (1977). Workforce scheduling with cyclic demands and day off constraints. Management Science, 24, 161\u2013167.","journal-title":"Management Science"},{"key":"202_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"153","author":"F. Bellanti","year":"2004","unstructured":"Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy based neighbourhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28\u201340.","journal-title":"European Journal of Operational Research"},{"key":"202_CR7","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., Ferland, J. A., & Michelon, P. (1996). A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Science, 30, 183\u2013193.","journal-title":"Socio-Economic Planning Science"},{"key":"202_CR8","unstructured":"Burke, E., De Causmaecker, P., & Vanden Berghe, G. (1998). A hybrid tabu search algorithm for the nurse rostering problem. In Lecture notes in artificial intelligence: Vol. 1585. Simulated evolution and learning, selected papers of SEAL, Canberra (pp. 187\u2013194)."},{"key":"202_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4757-4137-7_7","volume-title":"Combinatorial optimization book series. Metaheuristics: computer decision-making","author":"E. Burke","year":"2003","unstructured":"Burke, E., De Causmaecker, P., Petrovic, S., & Vanden\u00a0Berghe, G. (2003). Variable neighbourhood search for nurse rostering problem. In M. G. C. Resende & J. P. de Sousa (Eds.), Combinatorial optimization book series. Metaheuristics: computer decision-making (pp. 153\u2013172). Dordrecht: Kluwer, Chapter 7."},{"key":"202_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. Burke","year":"2004","unstructured":"Burke, E., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. The Journal of Scheduling, 7, 441\u2013499.","journal-title":"The Journal of Scheduling"},{"key":"202_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"Charon, I., & Hurdy, O. (1993). The noising method: a new method for combinatorial optimization. Operations Research Letters, 14, 133\u2013137.","journal-title":"Operations Research Letters"},{"key":"202_CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0377-2217(00)00305-2","volume":"135","author":"I. Charon","year":"2001","unstructured":"Charon, I., & Hurdy, O. (2001). The noising methods: a generalization of some metaheuristics. European Journal of Operational Research, 135, 86\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"202_CR13","unstructured":"Cheng, B. M. W., Lee, J. H. M., & Wu, J. C. K. (1996). A nurse rostering system using constraint programming and redundant modelling. Technical report, Department of Computer Science and Engineering at The Chinese University of Hong Kong."},{"key":"202_CR14","first-page":"20","volume-title":"Modern heuristic techniques for combinatorial problems","author":"K. A. Dowsland","year":"1993","unstructured":"Dowsland, K. A. (1993). Simulated annealing. In C. Reeves (Ed.), Modern heuristic techniques for combinatorial problems (pp. 20\u201363). Oxford: Blackwell."},{"key":"202_CR15","doi-asserted-by":"crossref","unstructured":"Dowsland, K. A. (1998). Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research, 393\u2013407.","DOI":"10.1016\/S0377-2217(97)00281-6"},{"key":"202_CR16","doi-asserted-by":"crossref","unstructured":"Dowsland, K. A., & Thompson, J. M. (2000). Nurse scheduling with knapsacks, networks and tabu search. Journal of the Operational Research Society, 825\u2013833.","DOI":"10.1057\/palgrave.jors.2600970"},{"key":"202_CR17","first-page":"389","volume-title":"New ideas in optimization","author":"A. E. Eiben","year":"1999","unstructured":"Eiben, A. E., & van Hemert, J. I. (1999). SAW-ing EAs: adapting the fitness function for solving constrained problems. In New ideas in optimization (pp. 389\u2013402). London: McGraw-Hill, Chapter 26."},{"key":"202_CR18","unstructured":"Frances, M. N. (1966). Implementing a program of cyclical scheduling of nursing personnel. Hospitals, 108\u2013125, July 16."},{"key":"202_CR19","doi-asserted-by":"crossref","unstructured":"Glover, F. (1989). Tabu search. Part I. ORSA Journal on Computing, 190\u2013206.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"202_CR20","unstructured":"Howell, J. P. (1966). Cyclical scheduling of nursing personnel. Hospitals, 77\u201385, January 16."},{"key":"202_CR21","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 671\u2013680.","DOI":"10.1126\/science.220.4598.671"},{"key":"202_CR22","doi-asserted-by":"crossref","unstructured":"Lundy, M., & Mees, A. (1986). Convergence of an annealing algorithm. Mathematical Programming, 111\u2013124.","DOI":"10.1007\/BF01582166"},{"key":"202_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J. M. Thompson","year":"1996","unstructured":"Thompson, J. M., & Dowsland, K. A. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63, 105\u2013128.","journal-title":"Annals of Operations Research"},{"key":"202_CR24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0933-3657(00)00062-2","volume":"20","author":"C. Valouxis","year":"2000","unstructured":"Valouxis, C., & Housos, E. (2000). Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine, 20, 155\u2013175.","journal-title":"Artificial Intelligence in Medicine"},{"key":"202_CR25","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1057\/jors.1996.34","volume":"47","author":"M. Wright","year":"1996","unstructured":"Wright, M. (1996). School timetabling using heuristic search. Journal of the Operational Research Society, 47, 347\u2013357.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0202-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0202-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0202-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:41Z","timestamp":1559153261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0202-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,20]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,8,22]]}},"alternative-id":["202"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0202-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,20]]}}}