{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:17:03Z","timestamp":1742998623006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_2","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"16-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Trains with Small Stretch on a Unidirectional Line"],"prefix":"10.1007","author":[{"given":"Apoorv","family":"Garg","sequence":"first","affiliation":[]},{"given":"Abhiram","family":"Ranade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R.: Randomized parallel communication (preliminary version). In: Proceedings of the First ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982, pp. 60\u201372. ACM, New York (1982)","DOI":"10.1145\/800220.806683"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.trb.2014.01.009","volume":"63","author":"V Cacchiani","year":"2014","unstructured":"Cacchiani, V., et al.: An overview of recovery models and algorithms for real-time railway rescheduling. Transp. Res. Part B: Methodol. 63, 15\u201337 (2014)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/07408179808966488","volume":"30","author":"X Cai","year":"1998","unstructured":"Cai, X., Goh, C., Mees, A.I.: Greedy heuristics for rapid scheduling of trains on a single track. IIE Trans. 30(5), 481\u2013493 (1998)","journal-title":"IIE Trans."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.1100.0349","volume":"45","author":"G Caimi","year":"2011","unstructured":"Caimi, G., Chudak, F., Fuchsberger, M., Laumanns, M., Zenklusen, R.: A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transp. Sci. 45(2), 212\u2013227 (2011)","journal-title":"Transp. Sci."},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0169-023X(97)00040-2","volume":"27","author":"T Chiang","year":"1998","unstructured":"Chiang, T., Hau, H., Chiang, H.M., Kob, S.Y., Hsieh, C.H.: Knowledge-based system for railway scheduling. Data Knowl. Eng. 27(3), 289\u2013312 (1998)","journal-title":"Data Knowl. Eng."},{"key":"2_CR6","unstructured":"Clementi, A., Ianni, M.D.: Optimum schedule problems in store and forward networks. In: 13th Proceedings of IEEE Networking for Global Communications, INFOCOM 1994, vol. 3, pp. 1336\u20131343, June 1994"},{"key":"2_CR7","unstructured":"D\u2019Ariano, A.: Improving real-time train dispatching: models, algorithms and applications. Doctoral thesis, TRAIL Research School, Deft, The Netherlands (2008)"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1109\/TITS.2015.2446985","volume":"16","author":"W Fang","year":"2015","unstructured":"Fang, W., Yang, S., Yao, X.: A survey on problem models and solution approaches to rescheduling in railway networks. IEEE Trans. Intell. Transp. Syst. 16(6), 2997\u20133016 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2_CR9","series-title":"OpenAccess Series in Informatics (OASIcs)","first-page":"61","volume-title":"10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS\u201910)","author":"H Flier","year":"2010","unstructured":"Flier, H., Mihal\u00e1k, M., Sch\u00f6bel, A., Widmayer, P., Zych, A.: Vertex disjoint paths for dispatching in railways. In: Erlebach, T., L\u00fcbbecke, M. (eds.) 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS\u201910). OpenAccess Series in Informatics (OASIcs), vol. 14, pp. 61\u201373. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2010)"},{"key":"2_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"2_CR11","unstructured":"Garg, A., Ranade, A.G.: Train scheduling on a unidirectional path. In: Lokam, S., Ramanujam, R. (eds.) 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 93, pp. 29:1\u201329:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/25.350284","volume":"44","author":"RV Iyer","year":"1995","unstructured":"Iyer, R.V., Ghosh, S.: Daryn-a distributed decision-making algorithm for railway networks: modeling and simulation. IEEE Trans. Veh. Technol. 44(1), 180\u2013191 (1995)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.trc.2010.12.004","volume":"20","author":"JT Krasemann","year":"2012","unstructured":"Krasemann, J.T.: Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transp. Res. Part C: Emerg. Technol. 20(1), 62\u201378 (2012). Special issue on Optimization in Public Transport+ISTT2011","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"FT Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in o(congestion+dilation) steps. Combinatorica 14(2), 167\u2013186 (1994)","journal-title":"Combinatorica"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Maggs, B., Richa, A.W.: Fast algorithms for finding o(congestion + dilation) packet routing schedules. Combinatorica 19(3), 375\u2013401 (1999)","journal-title":"Combinatorica"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jpdc.1996.0057","volume":"34","author":"JYT Leung","year":"1996","unstructured":"Leung, J.Y.T., Tam, T.W., Young, G.H.: On-line routing of real-time messages. J. Parallel Distrib. Comput. 34(2), 211\u2013217 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1287\/opre.1080.0642","volume":"57","author":"C Mannino","year":"2009","unstructured":"Mannino, C., Mascis, A.: Optimal real-time traffic control in metro stations. Oper. Res. 57(4), 1026\u20131039 (2009)","journal-title":"Oper. Res."},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., Pacciarelli, D.: Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3), 498\u2013517 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s13727-012-0006-x","volume":"2","author":"S Narayanaswami","year":"2011","unstructured":"Narayanaswami, S., Rangaraj, N.: Scheduling and rescheduling of railway operations: a review and expository analysis. Technol. Oper. Manage. 2(2), 102\u2013122 (2011)","journal-title":"Technol. Oper. Manage."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12450-1_20","volume-title":"Approximation and Online Algorithms","author":"B Peis","year":"2010","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing: complexity and algorithms. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 217\u2013228. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12450-1_20"},{"key":"2_CR21","first-page":"64","volume":"57","author":"P Pellegrini","year":"2013","unstructured":"Pellegrini, P., Rodriguez, J.: Single European sky and single european railway area: a system level analysis of air and rail transportation. Transp. Res. Part A: Policy Pract. 57, 64\u201386 (2013)","journal-title":"Transp. Res. Part A: Policy Pract."},{"key":"2_CR22","unstructured":"Ranade, A.G.: Fluent parallel computation. Ph.D. thesis, Department of Computer Science, Yale University, New Haven, CT, USA (1989). aAI9010675"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: A simpler proof for o(congestion + dilation) packet routing. CoRR abs\/1206.3718 (2012)","DOI":"10.1007\/978-3-642-36694-9_29"},{"issue":"7","key":"2_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0191-2615(99)00004-1","volume":"33","author":"I Sahin","year":"1999","unstructured":"Sahin, I.: Railway traffic control and train scheduling based oninter-train conflict management. Transp. Res. Part B: Methodol. 33(7), 511\u2013534 (1999)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S1364-8152(97)00026-1","volume":"12","author":"V Salim","year":"1997","unstructured":"Salim, V., Cai, X.: A genetic algorithm for railway scheduling with environmental considerations. Environ. Model Softw. 12(4), 301\u2013309 (1997)","journal-title":"Environ. Model Softw."},{"key":"2_CR26","first-page":"57","volume-title":"Lecture Notes in Computer Science","author":"C Scheideler","year":"1998","unstructured":"Scheideler, C.: Universal routing strategies for interconnection networks. In: Goos, G., Hartmanis, J., van Leeuwen, J. (eds.) Lecture Notes in Computer Science, vol. 1390, pp. 57\u201367. W. H. Freeman & Co., New York (1998)"},{"key":"2_CR27","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-78985-7_10","volume-title":"Metaheuristics for Scheduling in Industrial and Manufacturing Applications","author":"P Tormos","year":"2008","unstructured":"Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M., Salido, M.A.: A genetic algorithm for railway scheduling problems. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Studies in Computational Intelligence, vol. 128, pp. 255\u2013276. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78985-7_10"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E Upfal","year":"1984","unstructured":"Upfal, E.: Efficient schemes for parallel communication. J. ACM 31(3), 507\u2013517 (1984)","journal-title":"J. ACM"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.trb.2016.01.004","volume":"86","author":"D \u0160emrov","year":"2016","unstructured":"\u0160emrov, D., Marseti\u010d, R., \u017dura, M., Todorovski, L., Srdic, A.: Reinforcement learning approach for train rescheduling on a single-track railway. Transp. Res. Part B: Methodol. 86, 250\u2013267 (2016)","journal-title":"Transp. Res. Part B: Methodol."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:07:36Z","timestamp":1611792456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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,8","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,21","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)"}}]}}