Scheduling trains with priorities: A no-wait Blocking Parallel-Machine Job-Shop Scheduling model

Transportation Science

Volumn 45, Issue 2, 2011, Pages 175-198

  Liu, Shi Qiang ^a   Kozan, Erhan ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Blocking; Job Shop Scheduling; No wait; Parallel machine; Priorities; Train scheduling

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; PASSENGER CARS; RAILROAD TRANSPORTATION; SCHEDULING;

BLOCKING; NO WAIT; PARALLEL MACHINE; PRIORITIES; TRAIN SCHEDULING;

JOB SHOP SCHEDULING;

EID: 79957454187     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0332     Document Type: Article

References (29)

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