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 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 presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our dynamic...

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our dynamic...

This paper addresses the parameter modelling and optimisation issues in the application of a bio-inspired model for the scheduling of dynamic flexible job shop with sequence-dependent setups. The study sets the model parameters using two steps, termed mapping and tuning. Mapping establishes a...

This paper addresses the parameter modelling and optimisation issues in the application of a bio-inspired model for the scheduling of dynamic flexible job shop with sequence-dependent setups. The study sets the model parameters using two steps, termed mapping and tuning. Mapping establishes a...

We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order...

We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order...