2026-07-23T21:02:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3708 2024-03-06T10:29:04Z ddc:004 open_access

Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure Khosravi, Banafsheh Bennell, Julia A. Potts, Chris N. Train Scheduling and Rescheduling Job Shop Scheduling Shifting Bottleneck Procedure This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a well-established heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify the classical shifting bottleneck approach to make it suitable for the types of job shop problem that arises in train scheduling. The method decomposes the problem into several single machine problems. Different variations of the method are considered with regard to solving the single machine problems. We compare and report the performance of the algorithms for a case study based on part of the UK railway network. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Banafsheh Khosravi and Julia A. Bennell and Chris N. Potts 2012 Is Part Of OASIcs, Volume 25, 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2012.120 urn:nbn:de:0030-drops-37085 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.120 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode