__ Abstract __ This paper presents an overview of recovery models and algorithms for real-time railway disturbance and disruption management. This area is currently an active research area in Operations Research, including real-time timetable rescheduling and real-time rescheduling of the...

To enable rapid container transshipment between freight trains in modern rail-rail transshipment yards efficient computerized scheduling procedures are indispensable. This paper proposes a dynamic programming approach, which determines yard areas for gantry cranes, so that the workload is evenly...

This study uses stochastic frontier analysis for estimating efficiencies of railways systems in European countries. We consider railways as a system which uses its infrastructure (length of lines worked, numbers of cars and wagons, staff strength) and a scale of market (number of habitants and...

In this paper, train scheduling problem (TSCP) is discussed for the case of single-track railway corridor, in which variable sensitivity on train delay are discussed in detailed for different types of trains. The mathematical model is a complicated nonlinear mixed-integer programming. The object...

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal in a dynamic environment. This means that the handling times are not known exactly beforehand and that the order in which the different pieces of equipment...

This paper formulates the 3D containership loading planning problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. The key objective of stowage planning is to minimise the number of container movements and also the ship's instability. The binary formulation...

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that uses various combinatorial lower bounds....

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal in a dynamic environment. This means that the handling times are not known exactly beforehand and that the order in which the different pieces of equipment...

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and...

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that uses various combinatorial lower bounds....