{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:49:16Z","timestamp":1648748956466},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T00:00:00Z","timestamp":1261612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-009-0155-3","type":"journal-article","created":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T20:52:10Z","timestamp":1261601530000},"page":"23-38","source":"Crossref","is-referenced-by-count":5,"title":["Analysis of three mathematical models of the Staff Rostering Problem"],"prefix":"10.1007","volume":"15","author":[{"given":"\u00c9.","family":"Naudin","sequence":"first","affiliation":[]},{"given":"P. Y. C.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hiroux","sequence":"additional","affiliation":[]},{"given":"T.","family":"Zemmouri","sequence":"additional","affiliation":[]},{"given":"G.","family":"Weil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,24]]},"reference":[{"key":"155_CR1","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":"31","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., & Dowsland, K. A. (2000). Exploiting problem structure in a genetic algorithms approach to a nurse rostering problem. Journal of Scheduling, 31, 139\u2013153.","journal-title":"Journal of Scheduling"},{"key":"155_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"155_CR3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ejor.2005.04.028","volume":"175","author":"J. Beli\u00ebn","year":"2006","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2006). Scheduling trainees at a hospital department using a branch-and-price approach. European Journal of Operational Research, 175, 258\u2013278.","journal-title":"European Journal of Operational Research"},{"key":"155_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1520-6750(199302)40:1<69::AID-NAV3220400105>3.0.CO;2-H","volume":"40","author":"M. J. Brusco","year":"1993","unstructured":"Brusco, M. J., & Jacobs, L. W. (1993). A simulated annealing approach to the cyclic staff-scheduling problem. Naval Research Logistics, 40, 69\u201384.","journal-title":"Naval Research Logistics"},{"key":"155_CR5","unstructured":"Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1998). A\u00a0hybrid tabu search algorithm for the nurse rostering problem. In Selected papers from the 2nd Asia pacific conference on simulated evolution and learning (pp. 187\u2013194)."},{"issue":"6","key":"155_CR6","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"key":"155_CR7","first-page":"415","volume-title":"Annotated bibliographies in combinatorial optimization","author":"S. Ceria","year":"1997","unstructured":"Ceria, S., Nobili, P., & Sassano, A. (1997). Set covering problem. In M. Dell\u2019Amico, F. Maffoli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 415\u2013428). New York: Wiley."},{"key":"155_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"issue":"3","key":"155_CR9","first-page":"191","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M., & Soumis, F. (1988). A generalised permanent labelling algorithm for the shortest path problem with time windows. INFOR, 26(3), 191\u2013212.","journal-title":"INFOR"},{"key":"155_CR10","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M. Dror","year":"1994","unstructured":"Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research, 42, 977\u2013978. Technical Note.","journal-title":"Operations Research"},{"key":"155_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A. T. Ernst","year":"2004","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153, 3\u201337.","journal-title":"European Journal of Operational Research"},{"key":"155_CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.47.2.247","volume":"47","author":"M. Gamache","year":"1999","unstructured":"Gamache, M., Soumis, F., Marquis, G., & Desrosiers, J. (1999). A column generation approach for large scale aircrew rostering problems. Operations Research, 47, 247\u2013263.","journal-title":"Operations Research"},{"key":"155_CR13","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. C. Gilmore","year":"1960","unstructured":"Gilmore, P. C., & Gomory, R. E. (1960). A linear programming approach to the cutting stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"issue":"1","key":"155_CR14","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. (1998). A generalized linear programming model for nurse scheduling. European Journal of Operational Research, 107(1), 1\u201318.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"155_CR15","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/j.cor.2005.05.024","volume":"34","author":"T. Mautor","year":"2007","unstructured":"Mautor, T. Naudin, \u00c9. (2007). Arcs-states models for the vehicle routing problem with time windows and related problems. Computers and Operations Research, 34(4), 1061\u20131084.","journal-title":"Computers and Operations Research"},{"key":"155_CR16","unstructured":"Naudin, \u00c9. (2003) Probl\u00e8mes de tourn\u00e9es de v\u00e9hicules avec contraintes de ressources: mod\u00e9lisation par arcs-\u00e9tats et techniques de r\u00e9solution adapt\u00e9es. PhD thesis, University Pierre et Marie Curie\u2014Paris 6."},{"issue":"5","key":"155_CR17","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.24.5.842","volume":"24","author":"D. M. Warner","year":"1976","unstructured":"Warner, D. M. (1976). Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research, 24(5), 842\u2013856.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0155-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0155-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0155-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0155-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,24]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0155-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,24]]}}}