Easy Cases of Deadlock Detection in Train Scheduling

Published Online:https://doi.org/10.1287/opre.2022.2283

References

  • Arbib C, Italiano GF, Panconesi A (1990) Predicting deadlock in store-and-forward networks. Networks 20(7):861–881.CrossrefGoogle Scholar
  • Ahujia RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Upper Saddle River, NJ).Google Scholar
  • Corman F, Meng L (2015) A review of online dynamic models and algorithms for railway traffic management. IEEE Trans. Intelligent Transportation Systems 16(3):1274–1284.CrossrefGoogle Scholar
  • Cui Y (2010) Simulation based hybrid model for a partially automatic dispatching of railway operation. Unpublished doctoral dissertation, University of Stuttgart.Google Scholar
  • Cui Y, Martin U, Liang J (2017) Searching feasible resources to reduce false-positive situations for resolving deadlocks with the Banker’s algorithm in railway simulation. J. Rail Transport Planning Management. 7(1–2):50–61.CrossrefGoogle Scholar
  • Galli L, Stiller S (2018) Modern challenges in timetabling. Borndörfer R, Klug T, Lamorgese L, Mannino C, Reuther M, Schlec T, eds. Handbook of Optimization in the Railway Industry (Springer, Cham, Switzerland), 117–140.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York).Google Scholar
  • Gawrilow E, Köhler E, Möhring RH, Stenzel B (2008) Dynamic routing of automated guided vehicles in real-time. Krebs H-J, Jäger W, eds. Mathematics: Key Technology for the Future (Springer, Berlin), 165–177.CrossrefGoogle Scholar
  • Habermann AN (1969) Prevention of system deadlocks. Comm. ACM 12(7):373–377.CrossrefGoogle Scholar
  • Kjenstad D, Mannino C, Schittekat P, Smedsrud M (2013) Integrated surface and departure management at airports by optimization. Proc. Fifth Internat. Conf. Model. Simulation Appl. Optim. (IEEE, Piscataway, NJ), 1–5.Google Scholar
  • Lamorgese L, Mannino C (2015) An exact decomposition approach for the real-time train dispatching problem. Oper. Res. 63(1):48–64.LinkGoogle Scholar
  • Lamorgese L, Mannino C (2019) A noncompact formulation for job-shop scheduling problems in traffic management. Oper. Res. 67(6):1586–1609.LinkGoogle Scholar
  • Lamorgese L, Mannino C, Pacciarelli D, Krasemann JT (2018) Train dispatching. Borndörfer R, Klug T, Lamorgese L, Mannino C, Reuther M, Schlechte T, eds. Handbook of Optimization in the Railway Industry (Springer, Cham, Switzerland), 265–283.CrossrefGoogle Scholar
  • Li CL, McCormick TS, Simchi-Levi D (1992) Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22(7):653–667.CrossrefGoogle Scholar
  • Li F, Sheu JB, Gao ZY (2014) Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system. Transportation Res. Part B Methodological 68:385–414.CrossrefGoogle Scholar
  • Lu Q, Dessouky M, Leachman RC (2004) Modeling train movements through complex rail networks. ACM Trans. Model. Comput. Simulation 14(1):48–75.CrossrefGoogle Scholar
  • Lübbecke E, Lübbecke ME, Möhring RH (2019) Ship traffic optimization for the Kiel Canal. Oper. Res. 67(3):791–812.LinkGoogle Scholar
  • Mannino C, Nakkerud A, Sartor G (2021) Air traffic flow management with layered workload constraints. Comput. Oper. Res. 127:105159.CrossrefGoogle Scholar
  • Markets and Markets (2019) Railway system market by system type, transit type, application, and region—Global forecast to 2025 (April), https://www.marketsandmarkets.com/Market-Reports/railway-system-market-203815831.html.Google Scholar
  • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3):498–517.CrossrefGoogle Scholar
  • Mazzanti F, Spagnolo G, Della Longa S, Ferrari A (2014) Deadlock avoidance in train scheduling: A model checking approach. Lang F, Flammini F, eds. Formal Methods for Industrial Critical Systems (Springer, Cham, Switzerland), 109–123.Google Scholar
  • Pachl J (2011) Deadlock avoidance in railroad operations simulations. 90th Annual Meeting Transportation Res. Board, Washington, DC, January 23–27, 11-0175.Google Scholar
  • Petersen ER, Taylor J (1982) A structured model for rail line simulation and optimization. Transportation Sci. 16(2):192–206.LinkGoogle Scholar
  • Pinedo M (2012) Scheduling (Springer, Boston).CrossrefGoogle Scholar
  • Queyranne M, Schulz A (1994) Polyhedral approaches to machine scheduling. Technical report, TU Berlin.Google Scholar
  • Simon B, Jaumard B, Le TH (2014) Deadlock avoidance and detection in railway simulation systems. Transportation Res. Record 2448(1):45–52.CrossrefGoogle Scholar
  • UNIFE (2018) World rail market study (September 18), https://www.unife.org/wp-content/uploads/2021/03/World-rail-market-sturdy.pdf.Google Scholar
  • Wen C, Huang P, Li Z, Lessan J, Fu L, Jiang C, Xu X (2019) Train dispatching management with data-driven approaches: A comprehensive review and appraisal. IEEE Access 7:114547–114571.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.