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 wellestablished heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify ...

Train scheduling is a complex and time consuming task of vital importance in many countries. To schedule trains more accurately, efficiently and robustly than permitted by current techniques a novel job shop approach is proposed and implemented. Unique characteristics of train scheduling are firstly incorporated into the disjunctive graph representation of the solution. Constructive algorithms ...

We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required. This class of problems has application in the Train Unit Scheduling Problem (TUSP) [1, 2], where train units of different traction types may not be coupled with each other to serve the same train trip. Computatio...

This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as possible. The described method was tested on a number of instances of NS, the largest operator of passenger t...

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. In this paper, a novel job shop approach is proposed to create a more efficient integrated harvesting and sugarcane transport scheduling system to reduce the cost of sugarcane transport. There are several benefits that can be attained by treating the train scheduling problem as a job shop pro...

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...