{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:18:07Z","timestamp":1648844287991},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10951-019-00604-y","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T07:14:32Z","timestamp":1550042072000},"page":"95-115","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the waiting time for a one-way shuttle service"],"prefix":"10.1007","volume":"23","author":[{"given":"Laurent","family":"Daudet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,13]]},"reference":[{"issue":"8","key":"604_CR1","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1287\/mnsc.24.8.819","volume":"24","author":"LC Barbosa","year":"1978","unstructured":"Barbosa, L. C., & Friedman, M. (1978). Deterministic inventory lot size models\u2014A general root law. Management Science, 24(8), 819\u2013826.","journal-title":"Management Science"},{"key":"604_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2013.11.003","volume":"44","author":"E Barrena","year":"2014","unstructured":"Barrena, E., Canca, D., Coelho, L., & Laporte, G. (2014). Exact formulations and algorithm for the train timetabling problem with dynamic demand. Computers & Operations Research, 44, 66\u201374.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"604_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10288-007-0037-5","volume":"6","author":"V Cacchiani","year":"2008","unstructured":"Cacchiani, V., Caprara, A., & Toth, P. (2008). A column generation approach to train timetabling on a corridor. 4OR: A Quarterly Journal of Operations Research, 6(2), 125\u2013142.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"3","key":"604_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.orl.2010.01.007","volume":"38","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., & Toth, P. (2010). Non-cyclic train timetabling and comparability graphs. Operations Research Letters, 38(3), 179\u2013184.","journal-title":"Operations Research Letters"},{"issue":"5","key":"604_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/07408179808966488","volume":"30","author":"X Cai","year":"1998","unstructured":"Cai, X., Goh, C. J., & Mees, A. (1998). Greedy heuristics for rapid scheduling of trains on a single track. IIE Transactions, 30(5), 481\u2013493.","journal-title":"IIE Transactions"},{"issue":"5","key":"604_CR6","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/opre.50.5.851.362","volume":"50","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Fischetti, M., & Toth, P. (2002). Modeling and solving the train timetabling problem. Operations Research, 50(5), 851\u2013861.","journal-title":"Operations Research"},{"issue":"2","key":"604_CR7","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.trb.2010.09.001","volume":"45","author":"R Cordone","year":"2011","unstructured":"Cordone, R., & Redaelli, F. (2011). Optimizing the demand captured by a railway system with a regular timetable. Transportation Research Part B: Methodological, 45(2), 430\u2013446.","journal-title":"Transportation Research Part B: Methodological"},{"key":"604_CR8","first-page":"51","volume-title":"Generalized concavity in optimization and economics","author":"WE Diewert","year":"1981","unstructured":"Diewert, W. E. (1981). Alternative characterizations of six kinds of quasiconcavity in the nondifferentiable case with applications to nonsmooth programming. In S. Schaible & W. T. Ziemba (Eds.), Generalized concavity in optimization and economics (pp. 51\u201393). New York: Academic Press."},{"key":"604_CR9","doi-asserted-by":"crossref","unstructured":"Dooly, D.\u00a0R., Goldman, S.\u00a0A., & Scott, S.\u00a0D. (1998). TCP dynamic acknowledgment delay (extended abstract): Theory and practice. In Proceedings of the thirtieth annual ACM symposium on Theory of Computing (pp. 389\u2013398). ACM.","DOI":"10.1145\/276698.276792"},{"issue":"6","key":"604_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10951-013-0348-7","volume":"17","author":"H Ilani","year":"2014","unstructured":"Ilani, H., Shufan, E., Grinshpoun, T., Belulu, A., & Fainberg, A. (2014). A reduction approach to the two-campus transport problem. Journal of Scheduling, 17(6), 587\u2013599.","journal-title":"Journal of Scheduling"},{"key":"604_CR11","doi-asserted-by":"crossref","unstructured":"Ingolotti, L., Lova, A., Barber, F., Tormos, P., Salido, M.\u00a0A., & Abril, M. (2006). New heuristics to solve the CSOP railway timetabling problem. In International conference on industrial, engineering and other applications of applied intelligent systems (pp. 400\u2013409). Springer.","DOI":"10.1007\/11779568_44"},{"issue":"2","key":"604_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/trsc.37.2.198.15247","volume":"37","author":"L Kroon","year":"2003","unstructured":"Kroon, L., & Peeters, L. (2003). A variable trip time model for cyclic railway timetabling. Transportation Science, 37(2), 198\u2013212.","journal-title":"Transportation Science"},{"issue":"1","key":"604_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1287\/inte.1080.0409","volume":"39","author":"L Kroon","year":"2009","unstructured":"Kroon, L., Huisman, D., Abbink, E., Fioole, P.-J., Fischetti, M., Mar\u00f3ti, G., et al. (2009). The new Dutch timetable: The OR revolution. Interfaces, 39(1), 6\u201317.","journal-title":"Interfaces"},{"key":"604_CR14","unstructured":"Lehoux-Lebacque, V., Brauner, N., Finke, G., & Rapine, C. (2007). Scheduling chemical experiments. In 37th international conference on computers and industrial engineering, (CIE37)."},{"key":"604_CR15","doi-asserted-by":"crossref","unstructured":"Liebchen, C. (2003). Finding short integral cycle bases for cyclic timetabling. In European symposium on algorithms (pp. 715\u2013726). Springer.","DOI":"10.1007\/978-3-540-39658-1_64"},{"issue":"6","key":"604_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/S1571-0661(04)80526-7","volume":"66","author":"C Liebchen","year":"2002","unstructured":"Liebchen, C., & M\u00f6hring, R. (2002). A case study in periodic timetabling. Electronic Notes in Theoretical Computer Science, 66(6), 18\u201331.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"604_CR17","doi-asserted-by":"crossref","unstructured":"Little, J.\u00a0D. C, & Graves, S.\u00a0C. (2008). Little\u2019s law. In Building intuition (pp. 81\u2013100). Springer.","DOI":"10.1007\/978-0-387-73699-0_5"},{"issue":"5","key":"604_CR18","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/0305-0548(95)00032-1","volume":"23","author":"K Nachtigall","year":"1996","unstructured":"Nachtigall, K., & Voget, S. (1996). A genetic algorithm approach to periodic railway synchronization. Computers & Operations Research, 23(5), 453\u2013463.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"604_CR19","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P Serafini","year":"1989","unstructured":"Serafini, P., & Ukovich, W. (1989). A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics, 2(4), 550\u2013581.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"604_CR20","unstructured":"Voorhoeve, M. (1993). Rail scheduling with discrete sets. Unpublished report, Eindhoven University of Technology, The Netherlands."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00604-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00604-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00604-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T12:26:49Z","timestamp":1583584009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00604-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,13]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["604"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00604-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,13]]},"assertion":[{"value":"13 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}