{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:26:35Z","timestamp":1748870795522},"reference-count":17,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2012,9,29]],"date-time":"2012-09-29T00:00:00Z","timestamp":1348876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"DOI":"10.1007\/s10951-012-0289-6","type":"journal-article","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T16:33:53Z","timestamp":1349022833000},"source":"Crossref","is-referenced-by-count":2,"title":["Hybridising GRASP and network flows in the solution of a medical school scheduling problem"],"prefix":"10.1007","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":[[2012,9,29]]},"reference":[{"key":"289_CR1","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. (2003). Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29, 393\u2013430.","journal-title":"Parallel Computing"},{"issue":"3","key":"289_CR2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., & Roli, R. (2003). Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys, 35(3), 268\u2013308.","journal-title":"ACM Computing Surveys"},{"key":"289_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-45157-0_15","volume-title":"PATAT 2002","author":"S. Casey","year":"2003","unstructured":"Casey, S., & Thompson, J. (2003). GRASPing the examination scheduling problem. In E. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. PATAT 2002 (pp.\u00a0232\u2013244)."},{"key":"289_CR4","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. (1997). Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 102, 193\u2013214.","journal-title":"European Journal of Operational Research"},{"key":"289_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"289_CR6","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. (1994). A greedy randomised adaptive search procedure for maximum independent set. Operational Research, 42, 860\u2013878.","journal-title":"Operational Research"},{"key":"289_CR7","unstructured":"Festa, P., & Resende, M. G. C. (2004). An annotated bibliography of GRASP: AT&T Labs (Research technical report TD-5WYSEW)."},{"key":"289_CR8","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. (1999). Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"289_CR9","unstructured":"Goodman, M. (2007). Construction\u2013based metaheuristics for personnel scheduling problems. Ph.D. Thesis, Cardiff University."},{"issue":"4","key":"289_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10732-007-9066-7","volume":"15","author":"M. Goodman","year":"2009","unstructured":"Goodman, M., Dowsland, K. A., & Thompson, J. M. (2009). A grasp-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics, 15(4), 351\u2013379.","journal-title":"Journal of Heuristics"},{"key":"289_CR11","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. (2001). A GRASP for coloring sparse graphs. Computational Optimization and Applications, 19, 165\u2013178.","journal-title":"Computational Optimization and Applications"},{"key":"289_CR12","first-page":"168","volume-title":"Handbook of applied optimization","author":"L. Pitsoulis","year":"2001","unstructured":"Pitsoulis, L., & Resende, M. G. C. (2001). Greedy randomized adaptive search procedures. In M. P. Pardalos & M. G. C. Resende (Eds.), Handbook of applied optimization (pp.\u00a0168\u2013181)."},{"issue":"1","key":"289_CR13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.1030.0048","volume":"17","author":"S. Rojanasoonthon","year":"2005","unstructured":"Rojanasoonthon, S., & Bard, J. (2005). A GRASP for parallel machine scheduling with time windows. INFORMS Journal on Computing, 17(1), 32\u201351.","journal-title":"INFORMS Journal on Computing"},{"key":"289_CR14","first-page":"373","volume-title":"Greedy randomized adaptive search procedures (GRASP)","author":"M. G. C. Resende","year":"2001","unstructured":"Resende, M. G. C. (2001). Greedy randomized adaptive search procedures (GRASP) (Vol.\u00a02, pp.\u00a0373\u2013382). Dordrecht: Kluwer Academic."},{"key":"289_CR15","unstructured":"Resende, M. G. C., & Festa, P. (2003). An updated bibliography of GRASP: AT&T Labs Research Technical Report TD-5SB7BK."},{"key":"289_CR16","first-page":"219","volume-title":"Handbook of metaheuristics","author":"M. G. C. Resende","year":"2002","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2002). Greedy randomized adaptive search procedures. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp.\u00a0219\u2013249). Dordrecht: Kluwer Academic."},{"issue":"2","key":"289_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1011285402433","volume":"19","author":"A. J. Robertson","year":"2001","unstructured":"Robertson, A. J. (2001). A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Computational Optimization and Applications, 19(2), 145\u2013164.","journal-title":"Computational Optimization and Applications"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0289-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0289-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0289-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0289-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,29]]},"references-count":17,"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0289-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,29]]}}}