{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:53:38Z","timestamp":1760709218182},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319514680"},{"type":"electronic","value":"9783319514697"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-51469-7_23","type":"book-chapter","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T16:23:01Z","timestamp":1482596581000},"page":"269-280","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic Programming with Approximation Function for Nurse Scheduling"],"prefix":"10.1007","author":[{"given":"Peng","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,25]]},"reference":[{"issue":"10","key":"23_CR1","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1073\/pnas.42.10.767","volume":"42","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Dynamic programming and lagrange multipliers. Proc. Nat. Acad. Sci. 42(10), 767\u2013769 (1956)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"23_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate Dynamic Programming: Solving the Curses of Dimensionality","author":"WB Powell","year":"2007","unstructured":"Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality, vol. 703. Wiley, Hoboken (2007)"},{"issue":"3","key":"23_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Bergh Van den","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367\u2013385 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"23_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10951-007-0040-x","volume":"11","author":"M Elshafei","year":"2008","unstructured":"Elshafei, M., Alfares, H.K.: A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs. J. Sched. 11(2), 85\u201393 (2008)","journal-title":"J. Sched."},{"issue":"3","key":"23_CR5","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\u2013a bibliographic survey. Eur. J. Oper. Res. 151(3), 447\u2013460 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"23_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-010-0211-z","volume":"14","author":"P Causmaecker De","year":"2011","unstructured":"De Causmaecker, P., Berghe, G.V.: A categorisation of nurse rostering problems. J. Sched. 14(1), 3\u201316 (2011)","journal-title":"J. Sched."},{"key":"23_CR7","unstructured":"Curtois, T.: Employee shift scheduling benchmark data sets. Technical report, School of Computer Science, The University of Nottingham, Nottingham, UK, September 2014"},{"key":"23_CR8","unstructured":"Vanhoucke, M., Maenhout, B.: Characterisation and generation of nurse scheduling problem instances. Technical report, Ghent University, Faculty of Economics and Business Administration (2005)"},{"issue":"1","key":"23_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ejor.2011.09.007","volume":"218","author":"H-J Schuetz","year":"2012","unstructured":"Schuetz, H.-J., Kolisch, R.: Approximate dynamic programming for capacity allocation in the service industry. Eur. J. Oper. Res. 218(1), 239\u2013250 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR10","volume-title":"Dynamic Programming and Optimal Control","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. 1. Athena Scientific, Belmont (1995). (No. 2)"},{"key":"23_CR11","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, vol. 1. MIT Press, Cambridge (1998). (No. 1)"},{"key":"23_CR12","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (2014)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Koole, G., Pot, A.: Approximate dynamic programming in multi-skill call centers. In: 2005 Proceedings of the Winter Simulation Conference, pp. 576\u2013583. IEEE (2005)","DOI":"10.1109\/WSC.2005.1574297"},{"key":"23_CR15","unstructured":"Maenhout, B., Vanhoucke, M.: NSPLib - a nurse scheduling problem library: a tool to evaluate (meta-)heuristic procedures. In: OR in Health, pp. 151\u2013165. Elsevier (2005)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11730095_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"B Maenhout","year":"2006","unstructured":"Maenhout, B., Vanhoucke, M.: New computational results for the nurse scheduling problem: a scatter search algorithm. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 159\u2013170. Springer, Heidelberg (2006). doi: 10.1007\/11730095_14"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51469-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:43:00Z","timestamp":1498358580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51469-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319514680","9783319514697"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51469-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}