Techniques for inserting additional trains into existing timetables

Transportation Research Part B: Methodological

Volumn 43, Issue 8-9, 2009, Pages 821-836

  Burdett, R L ^a   Kozan, E ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Job shops; Meta heuristics; Time windows; Train scheduling

Indexed keywords

JOB SHOP SCHEDULING; OPTIMIZATION; PROBLEM SOLVING; RAILROADS; SCHEDULING;

CONSTRUCTIVE ALGORITHMS; JOB SHOP; META HEURISTICS; NUMERICAL INVESTIGATIONS; RAILWAY INFRASTRUCTURE; TIME WINDOW CONSTRAINT; TIME WINDOWS; TRAIN SCHEDULING;

RAILROAD TRANSPORTATION;

ALGORITHM; META-ANALYSIS; RAILWAY TRANSPORT; TRAIN; TRANSPORTATION INFRASTRUCTURE;

EID: 67651174323     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.02.005     Document Type: Article

References (25)

1. Aggoune R. Minimising the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research 153 3 (2004) 534-543
2. Asano M., and Ohta H. A heuristic for job shop scheduling to minimize total weighted tardiness. Computers and Industrial Engineering 42 2-4 (2002) 137-147
3. Burdett R., and Kozan E. Techniques for absolute capacity determination in railways. Transportation Research Part B 40 8 (2006) 616-632
4. Burdett R., and Kozan E. A sequencing approach for train timetabling. OR Spectrum (2008) 10.1007/s00291-008-0143-6
5. Cacchiani V., Caprara A., Toth P., 2008. Freight transportation in railway networks. Published online at: .
6. Carey M. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Research Part B 28 5 (1994) 333-353
7. Carey M., and Carville S. Scheduling and platforming trains at busy complex stations. Transportation Research Part A 37 3 (2003) 195-224
8. Carey M., and Crawford I. Scheduling trains on a network of busy complex stations. Transportation Research Part B 41 2 (2007) 159-178
9. D'Ariano A., Pacciarelli D., and Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183 2 (2007) 643-657
10. D'Ariano A., Pacciarelli D., and Pranzo M. Assessment of flexible timetables in real-time traffic management of a railway bottleneck. Transportation Research Part C 16 2 (2008) 232-245
11. Dessouky M., Lu Q., Zhao J., and Leachman R. An exact solution procedure for determining the optimal dispatching times for complex rail networks. IIE Transactions 38 2 (2006) 141-152
12. Goverde R. Railway timetable stability analysis using max-plus system theory. Transportation Research Part B 41 2 (2007) 179-201
13. Hall N.G., and Potts C.N. Rescheduling for new orders. Operations Research 52 3 (2004) 440-453
14. He Z., Yang T., and Tiger A. An exchange heuristic imbedded with simulated annealing for due dates job shop scheduling. European Journal of Operational Research 91 1 (1996) 99-117
15. Hendel Y., and Sourd F. Efficient neighbourhood search for the one machine earliness-tardiness scheduling problem. European Journal of Operational Research 173 1 (2006) 108-119
16. Jain A.K., and Elmaraghy H.A. Production scheduling/rescheduling in flexible manufacturing. International Journal of Production Research 35 1 (1997) 281-309
17. Mascis A., and Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 3 (2002) 498-517
18. Mazzarello M., and Ottaviani E. A traffic management system for real-time traffic optimisation in railways. Transportation Research Part B 41 2 (2007) 246-274
19. Rodriguez J. A constraint programming model for real time train scheduling at junctions. Transportation Research Part B 41 2 (2007) 231-245
20. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 1 (2000) 1-15
21. Sourd F. Punctuality and idleness in just in time scheduling. European Journal of Operational Research 167 3 (2005) 739-751
22. Sourd F. Optimal timing of a sequence of tasks with general completion costs. European Journal of Operational Research 165 1 (2005) 82-96
23. Valls V., Perez M.A., and Quintanilla M.S. A tabu search approach to machine scheduling. European Journal of Operational Research 106 2-3 (1998) 277-300
24. Viswanath K.G., Appa I.S., and Srinivasan G. Hierarchical minimisation of completion time variance and makespan in jobshops. Computers and Operations Research 33 5 (2006) 1345-1367
25. Zhou X., and Zhong M. Bicriteria train scheduling for high speed passenger railroad planning applications. European Journal of Operational Research 167 3 (2005) 752-771