Journal of Scheduling

, Volume 21, Issue 2, pp 191–207 | Cite as

Approaches to modeling train scheduling problems as job-shop problems with blocking constraints



The problem of scheduling a set of trains traveling through a given railway network consisting of single tracks, sidings and stations is considered. For every train a fixed route and travel times, an earliest departure time at the origin and a desired arrival time at the destination are given. A feasible schedule has to be determined which minimizes total tardiness of all trains at their destinations. This train scheduling problem is modeled as a job-shop scheduling problem with blocking constraints, where jobs represent trains and machines constitute tracks or track sections. Four MIP formulations without time-indexed variables are developed based on two different transformation approaches of parallel tracks and two different types of decision variables leading to job-shop scheduling problems with or without routing flexibility. A computational study is made on hard instances with up to 20 jobs and 11 machines to compare the MIP models in terms of total tardiness values, formulation size and computation time.


Train scheduling Job-shop Total tardiness Blocking Mixed integer programming 


  1. Burdett, R. L., & Kozan, E. (2010). A disjunctive graph model and framework for constructing new train schedules. European Journal of Operational Research, 200(1), 85–98.CrossRefGoogle Scholar
  2. Cacchiani, V., Galli, L. & Toth, P. (2013). A tutorial on train timetabling and train platforming problems. Tech. Rep. TR-13-10, Universit di Pisa, Dipartimanto di Informatica.Google Scholar
  3. Cai, X., & Goh, C. J. (1994). A fast heuristic for the train scheduling problem. Computers and Operations Research, 21(5), 499–510.CrossRefGoogle Scholar
  4. Carey, M. & Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of the Operational Research Society, 46, 988–1005.Google Scholar
  5. Cordeau, J. F., Toth, P., & Vigo, D. (1998). A survey of optimization models on train routing and scheduling. Transportation Science, 32(4), 380–404.CrossRefGoogle Scholar
  6. D’Ariano, A., Corman, F., Pacciarelli, D., & Pranzo, M. (2008). Reordering and local rerouting strategies to manage train traffic in real time. Transportation Science, 42(4), 405–419.CrossRefGoogle Scholar
  7. D’Ariano, A., Pacciarelli, D., & Pranzo, M. (2007). A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183(2), 643–657.CrossRefGoogle Scholar
  8. Dorfman, M., & Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B, 38(1), 81–98.CrossRefGoogle Scholar
  9. Gholami, O., Sotskov, Y. N., & Werner, F. (2013). Fast edge-orientation heuristics for job-shop scheduling problems with applications to train scheduling. International Journal of Operational Research, 2, 19–32.Google Scholar
  10. Ghoseiri, K., Szidarovszky, F., & Asgharpour, M. J. (2004). A multi-objective train scheduling model and solution. Transportation Research Part B: Methodological, 38(10), 927–952.CrossRefGoogle Scholar
  11. Groeflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643–3655.CrossRefGoogle Scholar
  12. Harrod, S. (2011). Modeling network transition constraints with hypergraphs. Transportation Science, 45(1), 81–97.CrossRefGoogle Scholar
  13. Higgins, A., Kozan, E., & Ferreira, L. (1996). Optimal scheduling of trains on a single line track. Transportation Research Part B: Methodological, 30(2), 147–161.CrossRefGoogle Scholar
  14. Higgins, A., Kozan, E., & Ferreira, L. (1997). Heuristic techniques for single line train scheduling. Journal of Heuristics, 3(1), 43–62.CrossRefGoogle Scholar
  15. Jovanovic, D., & Harker, P. T. (1991). Tactical scheduling of rail operations: The scan i system. Transportation Science, 25(1), 46–64.CrossRefGoogle Scholar
  16. Kreuger, P., Carlsson, M., Olsson, J., Sjöland, T. & Åström, E. (1997). Trip scheduling on single track networks–the tuff train scheduler. In: Workshop on industrial constraint directed scheduling (pp. 1–12). Google Scholar
  17. Kuhpfahl, J., & Bierwirth, C. (2016). A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Computers and Operations Research, 66, 44–57.CrossRefGoogle Scholar
  18. Lamorgese, L., & Mannino, C. (2013). The track formulation for the train dispatching problem. Electronic Notes in Discrete Mathematics, 41, 559–566.CrossRefGoogle Scholar
  19. Lange, J. (2015). Approaches to modeling job-shop problems with blocking constraints. In: Proceedings of the 7th multidisciplinary international conference on scheduling: Theory and applications (pp. 645–648). Prague. Google Scholar
  20. Li, F., Gao, Z., Li, K., & Yang, L. (2008). Efficient scheduling of railway traffic based on global information of train. Transportation Research Part B, 42(10), 1008–1030.CrossRefGoogle Scholar
  21. Liu, S. Q., & Kozan, E. (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers and Operations Research, 36(10), 2840–2852.CrossRefGoogle Scholar
  22. Lusby, R. M., Larsen, J., Ehrgott, M., & Ryan, D. (2011). Railway track allocation: Models and methods. OR Spectrum, 33(4), 843–883.CrossRefGoogle Scholar
  23. Manne, A. S. (1960). On the job-shop scheduling problem. Operations Research, 8(2), 219–223.CrossRefGoogle Scholar
  24. Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498–517.CrossRefGoogle Scholar
  25. Meng, L., & Zhou, X. (2014). Simultaneous train rerouting and rescheduling on an n-track network: A model reformulation with network-based cumulative flow variables. Transportation Research Part B: Methodological, 67, 208–234.CrossRefGoogle Scholar
  26. Niu, H., & Zhou, X. (2013). Optimizing urban rail timetable under time-dependent demand and oversaturated conditions. Transportation Research Part C: Emerging Technologies, 36, 212–230.CrossRefGoogle Scholar
  27. Niu, H., Zhou, X., & Gao, R. (2015). Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints. Transportation Research Part B: Methodological, 76, 117–135.Google Scholar
  28. Oliveira, E. & Smith, B.M. (2000). A job-shop scheduling model for the single-track railway scheduling problem. Research Report Series 21, School of Computing, University of Leeds.Google Scholar
  29. Pan, C. H. (1997). A study of integer programming formulations for scheduling problems. International Journal of Systems Science, 28(1), 33–41.CrossRefGoogle Scholar
  30. Sauder, R. L., & Westerman, W. M. (1983). Computer aided train dispatching: Decision support through optimization. Interfaces, 13(6), 24–37.CrossRefGoogle Scholar
  31. Szpigel, B. (1973). Optimal train scheduling on a single track railway. In M. Ross (Ed.), Operations Research. International Federation of Operational Research Societies (Vol. 72, pp. 343–352). Amsterdam: North-Holland Publishing Company.Google Scholar
  32. Törnquist, J., & Persson, J. A. (2007). N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B: Methodological, 41(3), 342–362.CrossRefGoogle Scholar
  33. Veelenturf, L.P., Kidd, M.P., Cacchiani, V., Kroon, L.G. & Toth, P. (2015). A railway timetable rescheduling approach for handling large-scale disruptions. Transportation Science, 50(3), 841–862.Google Scholar
  34. Vepsalainen, A. P., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035–1047.CrossRefGoogle Scholar
  35. Wagner, H. M. (1959). An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2), 131–140.CrossRefGoogle Scholar
  36. Xu, X., Li, K., & Yang, L. (2015). Scheduling heterogeneous train traffic on double tracks with efficient dispatching rules. Transportation Research Part B, 78, 364–384.CrossRefGoogle Scholar
  37. Yang, L., Li, K., & Gao, Z. (2009). Train timetable problem on a single-line railway with fuzzy passenger demand. IEEE Transactions on Fuzzy Systems, 17(3), 617–629.CrossRefGoogle Scholar
  38. Zhou, X., & Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B: Methodological, 41(3), 320–341.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Institute of Mathematical OptimizationOtto-von-Guericke-University MagdeburgMagdeburgGermany

Personalised recommendations