{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T10:49:15Z","timestamp":1724582955901},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","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":[[2018,4]]},"DOI":"10.1007\/s10951-017-0526-0","type":"journal-article","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T07:28:09Z","timestamp":1493278089000},"page":"191-207","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Approaches to modeling train scheduling problems as job-shop problems with blocking constraints"],"prefix":"10.1007","volume":"21","author":[{"given":"Julia","family":"Lange","sequence":"first","affiliation":[]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"issue":"1","key":"526_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2008.12.005","volume":"200","author":"RL Burdett","year":"2010","unstructured":"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\u201398.","journal-title":"European Journal of Operational Research"},{"key":"526_CR2","unstructured":"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."},{"issue":"5","key":"526_CR3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/0305-0548(94)90099-X","volume":"21","author":"X Cai","year":"1994","unstructured":"Cai, X., & Goh, C. J. (1994). A fast heuristic for the train scheduling problem. Computers and Operations Research, 21(5), 499\u2013510.","journal-title":"Computers and Operations Research"},{"key":"526_CR4","doi-asserted-by":"crossref","unstructured":"Carey, M. & Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of the Operational Research Society, 46, 988\u20131005.","DOI":"10.1057\/jors.1995.136"},{"issue":"4","key":"526_CR5","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"JF Cordeau","year":"1998","unstructured":"Cordeau, J. F., Toth, P., & Vigo, D. (1998). A survey of optimization models on train routing and scheduling. Transportation Science, 32(4), 380\u2013404.","journal-title":"Transportation Science"},{"issue":"4","key":"526_CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1287\/trsc.1080.0247","volume":"42","author":"A D\u2019Ariano","year":"2008","unstructured":"D\u2019Ariano, 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\u2013419.","journal-title":"Transportation Science"},{"issue":"2","key":"526_CR7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, 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\u2013657.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"526_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0191-2615(03)00006-7","volume":"38","author":"M Dorfman","year":"2004","unstructured":"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\u201398.","journal-title":"Transportation Research Part B"},{"key":"526_CR9","first-page":"19","volume":"2","author":"O Gholami","year":"2013","unstructured":"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\u201332.","journal-title":"International Journal of Operational Research"},{"issue":"10","key":"526_CR10","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.trb.2004.02.004","volume":"38","author":"K Ghoseiri","year":"2004","unstructured":"Ghoseiri, K., Szidarovszky, F., & Asgharpour, M. J. (2004). A multi-objective train scheduling model and solution. Transportation Research Part B: Methodological, 38(10), 927\u2013952.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"17","key":"526_CR11","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Groeflin","year":"2009","unstructured":"Groeflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643\u20133655.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"526_CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/trsc.1100.0337","volume":"45","author":"S Harrod","year":"2011","unstructured":"Harrod, S. (2011). Modeling network transition constraints with hypergraphs. Transportation Science, 45(1), 81\u201397.","journal-title":"Transportation Science"},{"issue":"2","key":"526_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0191-2615(95)00022-4","volume":"30","author":"A Higgins","year":"1996","unstructured":"Higgins, A., Kozan, E., & Ferreira, L. (1996). Optimal scheduling of trains on a single line track. Transportation Research Part B: Methodological, 30(2), 147\u2013161.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"526_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009672832658","volume":"3","author":"A Higgins","year":"1997","unstructured":"Higgins, A., Kozan, E., & Ferreira, L. (1997). Heuristic techniques for single line train scheduling. Journal of Heuristics, 3(1), 43\u201362.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"526_CR15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/trsc.25.1.46","volume":"25","author":"D Jovanovic","year":"1991","unstructured":"Jovanovic, D., & Harker, P. T. (1991). Tactical scheduling of rail operations: The scan i system. Transportation Science, 25(1), 46\u201364.","journal-title":"Transportation Science"},{"key":"526_CR16","unstructured":"Kreuger, P., Carlsson, M., Olsson, J., Sj\u00f6land, T. & \u00c5str\u00f6m, E. (1997). Trip scheduling on single track networks\u2013the tuff train scheduler. In: Workshop on industrial constraint directed scheduling (pp. 1\u201312)."},{"key":"526_CR17","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","volume":"66","author":"J Kuhpfahl","year":"2016","unstructured":"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\u201357.","journal-title":"Computers and Operations Research"},{"key":"526_CR18","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.endm.2013.05.138","volume":"41","author":"L Lamorgese","year":"2013","unstructured":"Lamorgese, L., & Mannino, C. (2013). The track formulation for the train dispatching problem. Electronic Notes in Discrete Mathematics, 41, 559\u2013566.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"526_CR19","unstructured":"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\u2013648). Prague."},{"issue":"10","key":"526_CR20","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1016\/j.trb.2008.03.003","volume":"42","author":"F Li","year":"2008","unstructured":"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\u20131030.","journal-title":"Transportation Research Part B"},{"issue":"10","key":"526_CR21","doi-asserted-by":"crossref","first-page":"2840","DOI":"10.1016\/j.cor.2008.12.012","volume":"36","author":"SQ Liu","year":"2009","unstructured":"Liu, S. Q., & Kozan, E. (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers and Operations Research, 36(10), 2840\u20132852.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"526_CR22","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1007\/s00291-009-0189-0","volume":"33","author":"RM Lusby","year":"2011","unstructured":"Lusby, R. M., Larsen, J., Ehrgott, M., & Ryan, D. (2011). Railway track allocation: Models and methods. OR Spectrum, 33(4), 843\u2013883.","journal-title":"OR Spectrum"},{"issue":"2","key":"526_CR23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A. S. (1960). On the job-shop scheduling problem. Operations Research, 8(2), 219\u2013223.","journal-title":"Operations Research"},{"issue":"3","key":"526_CR24","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498\u2013517.","journal-title":"European Journal of Operational Research"},{"key":"526_CR25","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.trb.2014.05.005","volume":"67","author":"L Meng","year":"2014","unstructured":"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\u2013234.","journal-title":"Transportation Research Part B: Methodological"},{"key":"526_CR26","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.trc.2013.08.016","volume":"36","author":"H Niu","year":"2013","unstructured":"Niu, H., & Zhou, X. (2013). Optimizing urban rail timetable under time-dependent demand and oversaturated conditions. Transportation Research Part C: Emerging Technologies, 36, 212\u2013230.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"526_CR27","doi-asserted-by":"crossref","unstructured":"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\u2013135.","DOI":"10.1016\/j.trb.2015.03.004"},{"key":"526_CR28","unstructured":"Oliveira, E. & Smith, B.M. (2000). A job-shop scheduling model for the single-track railway scheduling problem. Research Report Series\u00a021, School of Computing, University of Leeds."},{"issue":"1","key":"526_CR29","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/00207729708929360","volume":"28","author":"CH Pan","year":"1997","unstructured":"Pan, C. H. (1997). A study of integer programming formulations for scheduling problems. International Journal of Systems Science, 28(1), 33\u201341.","journal-title":"International Journal of Systems Science"},{"issue":"6","key":"526_CR30","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/inte.13.6.24","volume":"13","author":"RL Sauder","year":"1983","unstructured":"Sauder, R. L., & Westerman, W. M. (1983). Computer aided train dispatching: Decision support through optimization. Interfaces, 13(6), 24\u201337.","journal-title":"Interfaces"},{"key":"526_CR31","first-page":"343","volume-title":"Operations Research. International Federation of Operational Research Societies","author":"B Szpigel","year":"1973","unstructured":"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\u2013352). Amsterdam: North-Holland Publishing Company."},{"issue":"3","key":"526_CR32","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.trb.2006.06.001","volume":"41","author":"J T\u00f6rnquist","year":"2007","unstructured":"T\u00f6rnquist, J., & Persson, J. A. (2007). N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B: Methodological, 41(3), 342\u2013362.","journal-title":"Transportation Research Part B: Methodological"},{"key":"526_CR33","doi-asserted-by":"crossref","unstructured":"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\u2013862.","DOI":"10.1287\/trsc.2015.0618"},{"issue":"8","key":"526_CR34","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"AP Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"issue":"2","key":"526_CR35","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner, H. M. (1959). An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2), 131\u2013140.","journal-title":"Naval Research Logistics Quarterly"},{"key":"526_CR36","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.trb.2015.05.007","volume":"78","author":"X Xu","year":"2015","unstructured":"Xu, X., Li, K., & Yang, L. (2015). Scheduling heterogeneous train traffic on double tracks with efficient dispatching rules. Transportation Research Part B, 78, 364\u2013384.","journal-title":"Transportation Research Part B"},{"issue":"3","key":"526_CR37","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/TFUZZ.2008.924198","volume":"17","author":"L Yang","year":"2009","unstructured":"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\u2013629.","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"3","key":"526_CR38","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.trb.2006.05.003","volume":"41","author":"X Zhou","year":"2007","unstructured":"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\u2013341.","journal-title":"Transportation Research Part B: Methodological"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0526-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0526-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0526-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T10:29:16Z","timestamp":1520332156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0526-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0526-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,27]]}}}