{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T21:00:33Z","timestamp":1771275633947,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0377-2217(03)00096-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"28-40","source":"Crossref","is-referenced-by-count":65,"title":["A greedy-based neighborhood search approach to a nurse rostering problem"],"prefix":"10.1016","volume":"153","author":[{"given":"F.","family":"Bellanti","sequence":"first","affiliation":[]},{"given":"G.","family":"Carello","sequence":"additional","affiliation":[]},{"given":"F.","family":"Della Croce","sequence":"additional","affiliation":[]},{"given":"R.","family":"Tadei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00096-1_BIB1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","article-title":"Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem","volume":"3","author":"Aickelin","year":"2000","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB2","doi-asserted-by":"crossref","unstructured":"E.K. Burke, P. De Causmaecker, G. Vanden Berghe, A hybrid tabu search algorithm for the nurse rostering problem, in: Simulated Evolution and Learning\u2013\u2013Second Asia Pacific Conference on Simulated Evolution, 1999, pp. 187\u2013194","DOI":"10.1007\/3-540-48873-1_25"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB3","unstructured":"E.K. Burke, P. De Causmaecker, S. Petrovic, G. Vanden Berghe, Variable neighbourhood search for nurse rostering problems, in: 4th Metaheuristics International Conference Proceedings, Porto, July 2001, pp. 755\u2013760"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB4","unstructured":"G. Carello, An integer programming model for the nurse rostering problem, Internal Report, D.A.I., Politecnico di Torino, 2001"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","article-title":"An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem","volume":"14","author":"Congram","year":"2002","journal-title":"Informs Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","article-title":"An introduction to timetabling","volume":"19","author":"De Werra","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB7","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","article-title":"The combinatorics of timetabling","volume":"96","author":"De Werra","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","article-title":"Nurse scheduling with tabu search and strategic oscillation","volume":"106","author":"Dowsland","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search. Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search. Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB11","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.24.5.857","article-title":"Nurse scheduling using mathematical programming","volume":"24","author":"Miller","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB12","series-title":"Introduction to Employee Scheduling","author":"Nanda","year":"1992"},{"key":"10.1016\/S0377-2217(03)00096-1_BIB13","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.24.5.842","article-title":"Scheduling nursing personnel according to nursing preference: A mathematical programming approach","volume":"24","author":"Warner","year":"1976","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000961?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000961?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:24:03Z","timestamp":1553228643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703000961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0377221703000961"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00096-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}