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

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

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

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

Verfahren der Netzplantechnik stellen seit langem einen wesentlichen Beitrag der quantitativen Betriebswirtschaftslehre zur Unterstützung von Unternehmen dar. Die sorgfältige Planung knapper Ressourcen ist dabei häufig der Garant für unternehmerischen Erfolg. Jürgen Zimmermann gibt einen...