{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:20:03Z","timestamp":1775672403197,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031530241","type":"print"},{"value":"9783031530258","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53025-8_30","type":"book-chapter","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:02:12Z","timestamp":1706731332000},"page":"438-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using OR-Tools When Solving the Nurse Scheduling Problem"],"prefix":"10.1007","author":[{"given":"M\u00e1rcia","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"Ana Maria A. C.","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"Filipe","family":"Alves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,1]]},"reference":[{"key":"30_CR1","unstructured":"Ferreira, M.S., Rocha, S.: The staff scheduling problem\u202f: a general model and applications Marta Soares Ferreira da Silva Rocha Faculdade de Engenharia da Universidade do Porto (2013)"},{"issue":"1\u20132","key":"30_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10479-018-2848-5","volume":"272","author":"A Shuib","year":"2019","unstructured":"Shuib, A., Kamarudin, F.I.: Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model. Ann. Oper. Res. 272(1\u20132), 355\u2013372 (2019)","journal-title":"Ann. Oper. Res."},{"key":"30_CR3","volume-title":"Algorithms and Complexity 1","author":"J van Leeuwen","year":"1998","unstructured":"van Leeuwen, J.: Algorithms and Complexity 1. MIT Press, Cambridge (1998)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"106531","DOI":"10.1016\/j.cie.2020.106531","volume":"145","author":"AM Turhan","year":"2020","unstructured":"Turhan, A.M., Bilgen, B.: A hybrid fix-and-optimize and simulated annealing approaches for nurse rostering problem. Comput. Ind. Eng. 145, 106531 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.ejor.2009.05.046","volume":"202","author":"CA Glass","year":"2010","unstructured":"Glass, C.A., Knight, R.A.: The nurse rostering problem: a critical appraisal of the problem structure. Eur. J. Oper. Res. 202(2), 379\u2013389 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"34","author":"KE Burke","year":"2004","unstructured":"Burke, K.E., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 34, 441\u2013499 (2004)","journal-title":"J. Sched."},{"key":"30_CR7","unstructured":"Perron, L., Furnon, V.: OR-Tools. Google (2023)"},{"key":"30_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107282094","volume-title":"A Gentle Introduction to Optimization","author":"B Guenin","year":"2014","unstructured":"Guenin, B., K\u00f6nemann, J., Tun\u00e7el, L.: A Gentle Introduction to Optimization. University of Waterloo, Ontario (2014)"},{"key":"30_CR9","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Heidelberg (2006)"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0305-0483(96)00050-3","volume":"25","author":"VCS Wiers","year":"1997","unstructured":"Wiers, V.C.S.: A review of the applicability of OR and AI scheduling techniques in practice. Omega 25(2), 145\u2013153 (1997)","journal-title":"Omega"},{"issue":"1\u20134","key":"30_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"AT Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1\u20134), 21\u2013144 (2004)","journal-title":"Ann. Oper. Res."},{"key":"30_CR12","unstructured":"Petrovic, S., Berghe, G.V.: Comparison of algorithms for nurse rostering problems. In: 7th International Conference on Practice Theory Automation, Timetabling, PATAT 2008, vol. 44, pp. 1\u201318 (2008)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.9734\/ajrcos\/2019\/v3i230088","volume":"1995","author":"OM Alade","year":"2019","unstructured":"Alade, O.M., Amusat, A.O., Adedeji, O.T.: Solving nurse scheduling problem using constraint programming (CP) technique. Asian J. Res. Comput. Sci. 1995, 1\u20138 (2019)","journal-title":"Asian J. Res. Comput. Sci."},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","volume":"203","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. Eur. J. Oper. Res. 203(2), 484\u2013493 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR15","first-page":"195","volume":"23","author":"J Djordjevi\u0107","year":"2014","unstructured":"Djordjevi\u0107, J., Simi\u0107, D., Milutinovi\u0107, D., Simi\u0107, S.: Challenges for nurse rostering problem and opportunities in hospital logistics. J. Med. Informat. Technol. 23, 195\u2013202 (2014)","journal-title":"J. Med. Informat. Technol."},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"153","author":"F Bellanti","year":"2004","unstructured":"Bellanti, F., Carello, G., Croce, F.D., Tadei, R.: A greedy-based neighborhood search approach to a nurse rostering problem. Eur. J. Oper. Res. 153(1), 28\u201340 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"4-Part-1","key":"30_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/mnsc.19.4.411","volume":"19","author":"DM Warner","year":"1972","unstructured":"Warner, D.M., Prawda, J.: A mathematical programming model for scheduling nursing personnel in a hospital. Manag. Sci. 19(4-Part-1), 411\u2013422 (1972)","journal-title":"Manag. Sci."},{"issue":"9","key":"30_CR18","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/mnsc.22.9.972","volume":"22","author":"VM Trivedi","year":"1976","unstructured":"Trivedi, V.M., Warner, D.M.: Branch and bound algorithm for optimum allocation of float nurses. Manag. Sci. 22(9), 972\u2013981 (1976)","journal-title":"Manag. Sci."},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10479-014-1594-6","volume":"239","author":"HG Santos","year":"2016","unstructured":"Santos, H.G., Toffolo, T.A.M., Gomes, R.A.M., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239(1), 225\u2013251 (2016)","journal-title":"Ann. Oper. Res."},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","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 Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for the nurse rostering problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 187\u2013194. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48873-1_25"},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","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(3), 139\u2013153 (2000)","journal-title":"J. Sched."},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"EK Burke","year":"2008","unstructured":"Burke, E.K., Curtois, T., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur. J. Oper. Res. 188(2), 330\u2013341 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.asoc.2015.07.004","volume":"35","author":"MA Awadallah","year":"2015","unstructured":"Awadallah, M.A., Bolaji, A.L.A., Al-Betar, M.A.: A hybrid artificial bee colony for a nurse rostering problem. Appl. Soft Comput. J. 35, 726\u2013739 (2015)","journal-title":"Appl. Soft Comput. J."},{"key":"30_CR24","unstructured":"Curtois, T., Qu, R.: Computational results on new staff scheduling benchmark instances. Technical Report, pp. 1\u20135 (2014)"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"KA 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."},{"issue":"2","key":"30_CR26","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.ejor.2016.09.030","volume":"258","author":"E Rahimian","year":"2017","unstructured":"Rahimian, E., Akartunal\u0131, K., Levine, J.: A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems. Eur. J. Oper. Res. 258(2), 411\u2013423 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR27","unstructured":"Didier, F., Perron, L., Mohajeri, S., Gay, S.A., Cuvelier, T., Furnon, V.: OR-Tools\u2019 vehicle routing solver: a generic constraint-programming solver with heuristic search for routing problems, pp. 8\u20139 (2023)"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53025-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:16:55Z","timestamp":1706732215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53025-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031530241","9783031530258"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53025-8_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ol2a.ipb.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"162","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}