As a consequence of globalisation and increasing customer expectations, medium-sized less-than-truckload carriers operate together in cooperations. Each cooperative member faces a multitude of requirements when constructing a low-cost, feasible set of routes. Taking up this problem, we take...

We consider project scheduling problems subject to general temporal constraints, where the utilization of a set of renewable resources has to be smoothed over a prescribed planning horizon. In particular, we consider the classical resource leveling problem, where the variation in resource...

In this paper, we consider a variant of the many-to-many location-routing problem, where hub facilities have to be located and customers with either pickup or delivery demands have to be combined in vehicle routes. In addition, several commodities and inter-hub transport processes are taken into...

In reverse logistics networks, products (e.g., bottles or containers) have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service....

This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-distance road transport in Europe: Pickup-and-delivery requests have to be fulfilled over a multi-period planning horizon by a heterogeneous fleet of trucks and drivers. Typically, in the vehicle...

In this paper we deal with the time complexity of single- and identical parallel-machine scheduling problems in which the durations and precedence constraints of the activities are stochastic. The stochastic precedence constraints are given by GERT networks. First, we sketch the basic concepts...

In this paper we deal with the time complexity of single- and identical parallel-machine scheduling problems in which the durations and precedence constraints of the activities are stochastic. The stochastic precedence constraints are given by GERT networks. First, we sketch the basic concepts...

We study the scheduling of projects subject to general temporal constraints between activities such that the project net present value is maximized. The proposed algorithm is based on a first-order steepest ascent approach, where the steepest ascent directions are normalized by the supremum...

We study the scheduling of projects subject to general temporal constraints between activities such that the project net present value is maximized. The proposed algorithm is based on a first-order steepest ascent approach, where the steepest ascent directions are normalized by the supremum...