{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:27:40Z","timestamp":1768818460334,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T00:00:00Z","timestamp":1196121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10732-007-9066-7","type":"journal-article","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T18:08:18Z","timestamp":1196100498000},"page":"351-379","source":"Crossref","is-referenced-by-count":33,"title":["A grasp-knapsack hybrid for a nurse-scheduling problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Melissa D.","family":"Goodman","sequence":"first","affiliation":[]},{"given":"Kathryn A.","family":"Dowsland","sequence":"additional","affiliation":[]},{"given":"Jonathan M.","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,27]]},"reference":[{"key":"9066_CR1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Manag. Sci. 37, 98\u2013113 (1991)","journal-title":"Manag. Sci."},{"key":"9066_CR2","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","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Sched. 3, 139\u2013153 (2000)","journal-title":"J. Sched."},{"key":"9066_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.: An indirect genetic algorithm for a nurse-scheduling problem. Comput. Oper. Res. 31, 761\u2013778 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9066_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10479-007-0214-0","volume":"155","author":"U. Aickelin","year":"2007","unstructured":"Aickelin, U., Li, J.: An estimation of distribution algorithm for nurse scheduling. Ann. Oper. Res. 155, 289\u2013309 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9066_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parall. Comput. 29, 393\u2013430 (2003)","journal-title":"Parall. Comput."},{"key":"9066_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.: A greedy-based neighbourhood search approach to a nurse rostering problem. Eur. J. Oper. Res. 153, 28\u201340 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_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.: A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Econ. Plan. Sci. 30, 183\u2013193 (1996)","journal-title":"Socio-Econ. Plan. Sci."},{"key":"9066_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4615-1507-4_4","volume":"15","author":"S. Binato","year":"2001","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for job shop scheduling. Essays Surv. Metaheuristics 15, 81\u2013100 (2001)","journal-title":"Essays Surv. Metaheuristics"},{"key":"9066_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0377-2217(94)00063-I","volume":"86","author":"M.J. Brusco","year":"1995","unstructured":"Brusco, M.J., Jacobs, L.W.: Cost analysis of alternative formulations for personnel scheduling in continuous operating organizations. Eur. J. Oper. Res. 86, 249\u2013261 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-48873-1_25","volume-title":"Simulated Evolution and Learning","author":"E. Burke","year":"1999","unstructured":"Burke, E., De Causemaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for the nurse rostering problem. In: McKay, B., et al. (eds.) Simulated Evolution and Learning. Lecture Notes in Artificial Intelligence, vol. 1585, pp. 187\u2013194. Springer, Berlin (1999)"},{"issue":"3","key":"9066_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. Burke","year":"2001","unstructured":"Burke, E., Cowling, P., De Causmaecker, P., Vanden Berghe, G.: A memetic approach to the nurse rostering problem. Appl. Intell. 15(3), 199\u2013214 (2001)","journal-title":"Appl. Intell."},{"key":"9066_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4757-4137-7_7","volume-title":"METAHEURISTICS: Computer Decision-Making","author":"E. Burke","year":"2003","unstructured":"Burke, E., De Causemaecker, P., Petrovic, S., Vanden Berghe, G.: Variable neighbourhood search for nurse rostering problems. In: Resende, M.G.C., de Sousa, J.P. (eds.) METAHEURISTICS: Computer Decision-Making, pp. 153\u2013172. Kluwer Academic, Dordrecht (2003a), Chapter\u00a07"},{"key":"9066_CR13","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. Burke","year":"2003","unstructured":"Burke, E., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9, 451\u2013470 (2003b)","journal-title":"J. Heuristics"},{"key":"9066_CR14","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 Causemaecker, P., Vanden Burghe, G., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7, 441\u2013499 (2004)","journal-title":"J. Sched."},{"key":"9066_CR15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B. Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems\u2014a bibliographic survey. Eur. J. Oper. Res. 151, 447\u2013460 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K.A. Dowsland","year":"1998","unstructured":"Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. Eur. J. Oper. Res. 106, 393\u2013407 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR17","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"K.A. Dowsland","year":"2000","unstructured":"Dowsland, K.A., Thompson, J.M.: Solving a nurse-scheduling problem with knapsacks, networks and tabu search. J. Oper. Res. Soc. 51, 825\u2013833 (2000)","journal-title":"J. Oper. Res. Soc."},{"key":"9066_CR18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0377-2217(96)00209-3","volume":"102","author":"A. Drexl","year":"1997","unstructured":"Drexl, A., Salewski, F.: Distribution requirements and compactness constraints in school timetabling. Eur. J. Oper. Res. 102, 193\u2013214 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"T. Ernst","year":"2004","unstructured":"Ernst, T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a\u00a0review of applications, methods and models. Eur. J. Oper. Res. 153, 3\u201327 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR20","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomised adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9066_CR21","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11, 198\u2013204 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9066_CR22","unstructured":"Fuller, E.: Tackling scheduling problems using integer programming. Master Thesis, University of Wales Swansea, United Kingdom (1998)"},{"key":"9066_CR23","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"S.R. Gupta","year":"2006","unstructured":"Gupta, S.R., Smith, J.S.: Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Oper. Res. 175, 722\u2013739 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9066_CR24","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W.J. Gutjahr","year":"2007","unstructured":"Gutjahr, W.J., Rauner, M.S.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput. Oper. Res. 34(3), 642\u2013666 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9066_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:ANOR.0000019100.08333.a7","volume":"128","author":"M. Isken","year":"2004","unstructured":"Isken, M.: An implicit tour scheduling model with applications in healthcare. Ann. Oper. Res. 128, 91\u2013109 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9066_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00330-5","volume":"107","author":"B. Jaumard","year":"1998","unstructured":"Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107, 1\u201318 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","volume":"2","author":"M. Laguna","year":"1991","unstructured":"Laguna, M., Gonz\u00e1lez-Velarde, J.L.: A search heuristic for just-in-time scheduling in parallel machines. J.\u00a0Intell. Manufact. 2, 253\u2013260 (1991)","journal-title":"J.\u00a0Intell. Manufact."},{"key":"9066_CR28","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"Laguna, M., Mart\u00ed, R.: A GRASP for coloring sparse graphs. Comput. Optim. Appl. 19, 165\u2013178 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"9066_CR29","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.ejor.2005.02.065","volume":"174","author":"A. Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the travelling tournament problem. Eur. J. Oper. Res. 174, 1459\u20131478 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR30","volume-title":"Knapsack Problems","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems Wiley, Chichester (1990)"},{"key":"9066_CR31","doi-asserted-by":"crossref","unstructured":"Meyer auf\u2019m Hofe, H.: Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies, In: DIMACS Workshop on Constraints Programming and Large Scale Discrete Optimisation, pp. 67\u2013100 (2000)","DOI":"10.1090\/dimacs\/057\/05"},{"key":"9066_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z. Michalewicz","year":"2004","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2004)"},{"issue":"3","key":"9066_CR33","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M. Moz","year":"2007","unstructured":"Moz, M., Pato, M.V.: A genetic algorithm approach to a nurse re-rostering problem. Comput. Oper. Res. 34(3), 667\u2013691 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9066_CR34","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10479-007-0202-4","volume":"155","author":"D. Parr","year":"2007","unstructured":"Parr, D., Thompson, J.: Solving the multi-objective nurse scheduling problem with a weighted cost function. Ann. Oper. Res. 155, 279\u2013288 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9066_CR35","series-title":"Lecture Notes in Computer Science","first-page":"149","volume-title":"Practice and Theory of Automated Timetabling","author":"S. Petrovic","year":"2003","unstructured":"Petrovic, S., Beddoe, G., Vanden Berghe, G.: Storing and adapting repair experiences in personnel rostering. In: Burke, E.K., De Causemaecker, P. (eds.) Practice and Theory of Automated Timetabling, Fourth International Conference, Gent. Lecture Notes in Computer Science, vol.\u00a02740, pp. 149\u2013166. Springer, Berlin (2003)"},{"key":"9066_CR36","series-title":"Encyclopedia of Optimisation","first-page":"373","volume-title":"Greedy Randomized Adaptive Search Procedures (GRASP)","author":"M.G.C. Resende","year":"2001","unstructured":"Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures (GRASP). Encyclopedia of Optimisation, vol.\u00a02, pp. 373\u2013382. Kluwer Academic, Dordrecht (2001)"},{"key":"9066_CR37","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(87)90131-7","volume":"31","author":"E.S. Rosenbloom","year":"1987","unstructured":"Rosenbloom, E.S., Goertzen, N.F.: Cyclic nurse scheduling. Eur. J. Oper. Res. 31, 19\u201323 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"9066_CR38","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/BF02601641","volume":"63","author":"J.M. Thompson","year":"1996","unstructured":"Thompson, J.M., Dowsland, K.A.: Variants of simulated annealing for the examination timetabling problem. Ann. Oper. Res. 63, 637\u2013648 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9066_CR39","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1057\/jors.1991.93","volume":"42","author":"M.B. Wright","year":"1991","unstructured":"Wright, M.B.: Scheduling cricket umpires. J. Oper. Res. Soc. 42, 447\u2013452 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"9066_CR40","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1057\/palgrave.jors.2602110","volume":"57","author":"Y. Zhu","year":"2006","unstructured":"Zhu, Y., Lim, A.: Crane scheduling with non-crossing constraint. J. Oper. Res. Soc. 57, 1464\u20131471 (2006)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9066-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9066-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9066-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:29Z","timestamp":1559256869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9066-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,27]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9066"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9066-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,27]]}}}