Train scheduling and rescheduling in the UK with a modified shifting bottleneck procedure

OpenAccess Series in Informatics

Volumn 25, Issue , 2012, Pages 120-131

  Khosravi, Banafsheh ^a   Bennell, Julia A ^a   Potts, Chris N ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Job shop scheduling; Shifting bottleneck procedure; Train scheduling and rescheduling

Indexed keywords

JOB-SHOP SCHEDULING; MACHINE SCHEDULING PROBLEM; MIXED INTEGER LINEAR PROGRAMMING MODEL; RESCHEDULING PROBLEM; SHIFTING BOTTLENECK; SHIFTING BOTTLENECK PROCEDURES; SINGLE MACHINE PROBLEMS; TRAIN SCHEDULING;

ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION;

SCHEDULING;

EID: 84882989278     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2012.120     Document Type: Conference Paper

References (18)

1. J. Adams, E. Balas, D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3):391-401, 1988.
2. V. Cacchiani, P. Toth. Nominal and robust train timetabling problems. European Journal of Operational Research, 219(3):727-737, 2012.
3. G. Caimi. Algorithmic decision support for train scheduling in a large and highly utilised railway network. PhD thesis, Swiss Federal Institute of Technology Zurich, 2009.
4. A. Caprara, L. Kroon, M. Monaci, M. Peeters, P. Toth, Passenger Railway Optimization, In: C. Barnhart, G. Laporte (Eds.), Transportation, Handbooks in Operations Research and Management Science 14, Elsevier, 129-187, 2007.
5. F. Corman, A. D'Ariano, D. Pacciarelli, M. Pranzo. A tabu search algorithm for rerouting trains during rail operations. Transportation Research Part B, 44(1):175-192, 2010.
6. A. D'Ariano, D. Pacciarelli, M. Pranzo. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183(2):643-657, 2007.
7. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, San Franscisco, 1979.
8. D. Huisman, L. Kroon, R. Lentink, M. Vromans. Operations Research in passenger railway transportation. Statistica Neerlandica 59(4):467-497, 2005.
9. S.Q. Liu, E. Kozan. Scheduling trains as a blocking parallel-machine shop scheduling problem. Computers and Operations Research 36(10):2840-2852, 2009.
10. R. Lusby, J. Larsen, M. Ehrgott, and D. Ryan. Railway track allocation: models and methods. OR Spectrum, 33(4):843-883, 2011.
11. A. Mascis, D. Pacciarelli. Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143(3):498-517, 2002.
12. E. Oliveira, B.M. Smith. A job-shop scheduling model for the single-track railway scheduling problem. Technical Report No. 21, School of Computing, University of Leeds, UK, 2000.
13. M. Pinedo, M. Singer. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46(1):1-17, 1999.
14. J. Rodriguez. A constraint programming model for real-time trains scheduling at junctions. Transportation Research Part B 41(2):231-245, 2007.
15. B. Roy, R. Sussman. Les problèmes d'ordonnancement avec contraintes disjonctives. Technical Report No. 9, SEMA, Paris, 1964.
16. I. Sahin. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B 33(7):511-534, 1999.
17. B. Szpigel. Optimal train scheduling on a single track railway. In M. Ross (Ed.). Operational Research '72, Amsterdam, The Netherlands, 343-352, 1973.
18. J. Ullman. NP-complete scheduling problems. Journal of Computer and System Science, 10(3):384-393, 1975.