Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model

References

• Abril M., Salido M. A., Barber F. Distributed search in railway scheduling problems. Engrg. Appl. Artificial Intelligence (2008a) 21:744–755Crossref, Google Scholar
• Abril M., Barber F., Ingolotti L., Salido M. A., Tormos P., Lova A. An assessment of railway capacity. Transportation Res. Part E (2008b) 44:774–806Crossref, Google Scholar
• Beasley J. E. Benchmark problems. (2005) . http://people.brunel.ac.uk/∼mastjjb/jeb/orlibGoogle Scholar
• Burdett R. L., Kozan E. Techniques for absolute capacity determination in railways. Transportation Res. Part B (2006) 40:616–632Crossref, Google Scholar
• Burdett R. L., Kozan E. A disjunctive graph model and framework for constructing new train schedules. Eur. J. Oper. Res. (2009a) . doi:10.1016/j.ejor.2008.1012.1005Google Scholar
• Burdett R. L., Kozan E. Techniques for inserting additional trains into existing timetables. Transportation Res. Part B (2009b) . doi:10.1016/j.trb.2009.1002.1005Google Scholar
• Burdett R. L., Kozan E. Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules. Math. Comput. Modelling (2009c) 50:314–328Crossref, Google Scholar
• Cacchiani V., Caprara A., Toth P. A column generation approach to train timetabling on a corridor. Quart. J. Oper. Res. (2008) 6:125–142Crossref, Google Scholar
• Cai X., Goh C. J. A fast heuristic for the train scheduling problem. Comput. Oper. Res. (1994) 21(5):499–511Crossref, Google Scholar
• Caprara A., Fischetti M., Toth P. Modelling and solving the train timetabling problem. Oper. Res. (2002) 50:851–861Link, Google Scholar
• Caprara A., Monaci M., Toth P., Guida P. L. A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Appl. Math. (2006) 154(5):738–753Crossref, Google Scholar
• Carey M., Crawford I. Scheduling trains on a network of busy complex stations. Transportation Res. Part B (2007) 41:159–178Crossref, Google Scholar
• Chung J. W., Oh S. M., Choi I. C. A hybrid genetic algorithm for train sequencing in the Korean railway. Omega (2009) 37:555–565Crossref, Google Scholar
• D'Ariano A., Pacciarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. (2007) 183:643–657Crossref, Google Scholar
• D'Ariano A., Pacciarelli D., Pranzo M. Assessment of flexible timetables in real-time traffic management of a railway bottleneck. Transportation Res. Part C (2008) 16:232–245Crossref, Google Scholar
• Gröflin H., Klinkert A. A new neighborhood and tabu search for the Blocking Job Shop. Discrete Appl. Math. (2009) 157(17):3643–3655Crossref, Google Scholar
• Higgins A., Ferreira L., Kozan E. Modelling delay risks associated with a train schedule. Transportation Planning Tech. (1995) 19(2):89–108Crossref, Google Scholar
• Higgins A., Kozan E., Ferreira L. Modelling the number and location of sidings on a single line railway. Comput. Oper. Res. (1997a) 24(3):209–220Crossref, Google Scholar
• Higgins A., Kozan E., Ferreira L. Heuristic techniques for single line train scheduling. J. Heuristics (1997b) 3:43–62Crossref, Google Scholar
• Liebchen C. The first optimized railway timetable in practice. Transportation Sci. (2008) 42(4):420–435Link, Google Scholar
• Liu S. Q., Kozan E. Scheduling trains as a blocking parallel-machine job shop scheduling problem. Comput. Oper. Res. (2009a) 36:2840–2852Crossref, Google Scholar
• Liu S. Q., Kozan E. Scheduling a flow shop with combined buffer conditions. Internat. J. Production Econom. (2009b) 117:371–380Crossref, Google Scholar
• Liu S. Q., Ong H. L. Metaheuristics for the mixed shop scheduling problem. Asia-Pacific J. Oper. Res. (2004) 21(4):97–115Crossref, Google Scholar
• Mascis A., Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. (2002) 143:498–517Crossref, Google Scholar
• Petersen E. R. Over the road transit time for a single track railway. Transportation Sci. (1974) 8:65–74Link, Google Scholar
• Salido M. A. A non-binary constraint ordering heuristic for constraint satisfaction problems. Appl. Math. Comput. (2008) 198:280–295Crossref, Google Scholar
• Salido M. A., Barber F. Mathematical solutions for solving periodic railway transportation. Math. Problems Engrg. (2009) . Article ID 728916, doi:10.1155/2009/728916Google Scholar
• Salido M. A., Abril M., Barber F., Ingolotti L., Tormos P., Lova A. Domain-dependent distributed models for railway scheduling. Knowledge-Based Systems (2007) 20:186–194Crossref, Google Scholar
• Zhou X., Zhong M. Bicriteria train scheduling for high-speed passenger railway planning applications. Eur. J. Oper. Res. (2004) 167:752–771Crossref, Google Scholar