Scheduling of trains on a single line involves the use of train priorities for the resolution of conflicts. First, a mathematical programming model is described. The model schedules trains over a single line of track when the priority of each train in a conflict depends on an estimate of the remaining crossing and overtaking delay. This priority is used in a branch-and-bound procedure to allow ...

Scheduling of trains on a single line involves using train priorities for the resolution of conflicts. The mathematical programming model described in the first part of this paper schedules trains over a single line track when the priority of each train in a conflict depends on an estimate of the remaining crossing and overtaking delay. This priority is used in a branch and bound procedure to a...

This paper addresses a scheduling problem arising in the real time management of a metro rail terminus. It mainly consists in routing incoming trains through the station and scheduling their departures with the objective of optimizing punctuality and regularity of train service. The purpose of this work is to develop an automated train traffic control system, able to directly implement most tra...

In this paper, the train scheduling problem is modelled as a Blocking Parallel-Machine JobShop-Scheduling (BPMJSS) problem. In the model, trains, single-track sections and multiple-track sections respectively are synonymous with jobs, single machines and parallel machines; and an operation is regarded as the movement/traversal of a train across a section. Due to the lack of buffer space, the re...

The privatisation of British Rail into twenty five train operating companies and three freight companies has highlighted the need for each company to have efficient operating schedules. Manpower costs are a significant element in any transport organisation, and the ability to minimise these costs is seen as crucial to the well running of these companies. In addition, the need to try out differe...

Market demands for different classes of rail transportation service are not served because of the inability to assess the cost to the network of disparate services, as well as the inability to determine optimal scheduling. A new scheduling model is presented, based on a multicommodity flow and discrete time, that both selects an optimal set of trains and schedules these trains over a time horiz...

The train scheduling problem with the origin-destination (O-D) dependent passenger demands is considered for urban rail transit systems. In this paper, trains are allowed to skip any intermediate stations (except the origin station and the final station) to reduce the passenger travel time and to save energy consumption. A model of train movements with stop-skipping and the O-D dependent passen...

The paper studies a train scheduling problem faced by railway infrastructure managers during real-time traffic control. When train operations are perturbed, a new conflict-free timetable of feasible arrival and departure times needs to be recomputed, such that the deviation from the original one is minimized. The problem can be viewed as a huge job shop scheduling problem with no-store constrai...

The Union Pacific Railroad (UPRR) has over 3 1,000 miles of track covering a 24 state region. Planning and scheduling the production, packaging, delivery, and pickup of rail, involved in the maintenance of this network, is a very complex task. Manually scheduling only a subset of the resources required has historically taken several days to accomplish. Moreover, the inability to fully schedule ...

Attractive train schedules are quite important for the success of public rail transport. We consider schedules which are repeated after some xed time period. Periodicity is a well accepted, convenient attribute of all major railroad systems. Since trains share the public railroad network, we have to handle many connicting demands. Increasing competition from transportation alternatives as well ...