{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:57:31Z","timestamp":1725796651302},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_52","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"383-388","source":"Crossref","is-referenced-by-count":0,"title":["Workload Balancing in Transportation Crew Rostering"],"prefix":"10.1007","author":[{"given":"G\u00fcven\u00e7","family":"\u015eahin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fardin","family":"Dashty Saridarq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/0377-2217(95)00093-3","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J. E., & Cao, B. (1996). A tree search algorithm for the crew scheduling problem. European Journal of Operational Research, 94, 517\u2013526.","journal-title":"European Journal of Operational Research"},{"key":"52_CR2","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., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28\u201340.","journal-title":"European Journal of Operational Research"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke, E., Cowling, P., Causmaecker, P. D., & Berghe, G. V. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199\u2013214.","journal-title":"Applied Intelligence"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1287\/ijoc.1100.0410","volume":"23","author":"P Cappanera","year":"2011","unstructured":"Cappanera, P., & Scutell\u00e1, M. (2011). Color-coding algorithms to the balanced path problem: computational issues. INFORMS Journal on Computing, 23, 446\u2013459.","journal-title":"INFORMS Journal on Computing"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1016\/j.tre.2011.05.013","volume":"47","author":"G \u015eahin","year":"2011","unstructured":"\u015eahin, G., & Y\u00fcceo\u011flu, B. (2011). Tactical crew planning in railways. Transportation Research Part E: Logistics and Transportation Review, 47, 1221\u20131243.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T08:05:27Z","timestamp":1558944327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_52","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]}}}