{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:22:09Z","timestamp":1743124929669,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030597467"},{"type":"electronic","value":"9783030597474"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59747-4_24","type":"book-chapter","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T11:02:30Z","timestamp":1601118150000},"page":"371-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Daily Distribution of Duties for Crew Scheduling with Attendance Rates: A Case Study"],"prefix":"10.1007","author":[{"given":"Martin","family":"Scheffler","sequence":"first","affiliation":[]},{"given":"Janis Sebastian","family":"Neufeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"24_CR1","unstructured":"Abbink, E.J.W., Wout, J.V., Huisman, D.: Solving large scale crew scheduling problems by using iterative partitioning. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007). OASICS, vol. 7. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2007)"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s13675-017-0090-6","volume":"6","author":"C Artigues","year":"2018","unstructured":"Artigues, C., Jozefowiez, N., Sarpong, B.M.: Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective. EURO J. Computat. Optimizat. 6(2), 117\u2013142 (2018)","journal-title":"EURO J. Computat. Optimizat."},{"key":"24_CR3","first-page":"175","volume":"10","author":"S Chen","year":"2013","unstructured":"Chen, S., Shen, Y.: An improved column generation algorithm for crew scheduling problems. J. Inf. Computat. Sci. 10, 175\u2013183 (2013)","journal-title":"J. Inf. Computat. Sci."},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.06.016","volume":"283","author":"J Heil","year":"2020","unstructured":"Heil, J., Hoffmann, K., Buscher, U.: Railway crew scheduling: models, methods and applications. Euro. J. Oper. Res. 283(2), 405\u2013425 (2020)","journal-title":"Euro. J. Oper. Res."},{"key":"24_CR5","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-42902-1_33","volume-title":"Operations Research Proceedings 2015","author":"K Hoffmann","year":"2017","unstructured":"Hoffmann, K.: A hybrid solution approach for railway crew scheduling problems with attendance rates. In: Doerner, K.F., Ljubic, I., Pflug, G., Tragler, G. (eds.) Operations Research Proceedings 2015. ORP, pp. 243\u2013250. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42902-1_33"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Hoffmann, K., Buscher, U.: Valid inequalities for the arc flow formulation of the railway crew scheduling problem with attendance rates. Computers & Industrial Engineering (2018)","DOI":"10.1016\/j.cie.2018.05.031"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s12599-017-0470-8","volume":"59","author":"K Hoffmann","year":"2017","unstructured":"Hoffmann, K., Buscher, U., Neufeld, J.S., Tamke, F.: Solving practical railway crew scheduling problems with attendance rates. Bus. Inf. Syst. Eng. 59(3), 147\u2013159 (2017)","journal-title":"Bus. Inf. Syst. Eng."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1287\/inte.1100.0549","volume":"41","author":"S J\u00fctte","year":"2011","unstructured":"J\u00fctte, S., Albers, M., Thonemann, U.W., Haase, K.: Optimizing railway crew scheduling at db schenker. Interfaces 41(2), 109\u2013122 (2011)","journal-title":"Interfaces"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ejor.2011.12.038","volume":"219","author":"S J\u00fctte","year":"2012","unstructured":"J\u00fctte, S., Thonemann, U.W.: Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems. Euro. J. Oper. Res. 219(2), 214\u2013223 (2012)","journal-title":"Euro. J. Oper. Res."},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1080\/2058802X.2019.1664072","volume":"2019","author":"JS Neufeld","year":"2019","unstructured":"Neufeld, J.S.: Efficient railway crew scheduling in german regional passenger transport. Impact 2019(2), 7\u201310 (2019)","journal-title":"Impact"},{"issue":"6","key":"24_CR12","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.: Tactical crew planning in railways. Transport. Res. Part E: Logistics Transport. Rev. 47(6), 1221\u20131243 (2011)","journal-title":"Transport. Res. Part E: Logistics Transport. Rev."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1147\/rd.513.0325","volume":"51","author":"B Vaidyanathan","year":"2007","unstructured":"Vaidyanathan, B., Jha, K.C., Ahuja, R.K.: Multicommodity network flow approach to the railroad crew-scheduling problem. IBM J. Res. Dev. - Bus. optimizat. 51(3), 325\u2013344 (2007)","journal-title":"IBM J. Res. Dev. - Bus. optimizat."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59747-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T09:10:31Z","timestamp":1604308231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59747-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597467","9783030597474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59747-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2020.nl\/","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":"73","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":"49","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":"67% - 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":"2,5","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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}